Piecewise linear neuron modeling

ABSTRACT

Methods and apparatus for piecewise linear neuron modeling and implementing artificial neurons in an artificial nervous system based on linearized neuron models. One example method for operating an artificial neuron generally includes determining that a first state of the artificial neuron is within a first region; determining a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; determining that the second state of the artificial neuron is within a second region; and determining a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.

CLAIM OF PRIORITY UNDER 35 U.S.C. §119

This application claims benefit of U.S. Provisional Patent Application Ser. No. 61/728,360, filed Nov. 20, 2012 and entitled “Piecewise Linear Neuron Modeling,” U.S. Provisional Patent Application Ser. No. 61/734,716, filed Dec. 7, 2012 and entitled “Piecewise Linear Neuron Modeling,” U.S. Provisional Patent Application Ser. No. 61/740,633, filed Dec. 21, 2012 and entitled “Piecewise Linear Neuron Modeling,” and U.S. Provisional Patent Application Ser. No. 61/756,889, filed Jan. 25, 2013 and entitled “Piecewise Linear Neuron Modeling,” all of which are herein incorporated by reference in their entireties.

BACKGROUND

1. Field

Certain aspects of the present disclosure generally relate to artificial nervous systems and, more particularly, to approximating at least a portion of a nonlinear function of a neuron model as a piecewise linear function and to using the resulting linearized neuron model in one or more artificial neurons.

2. Background

An artificial neural network, which may comprise an interconnected group of artificial neurons (i.e., neuron models), is a computational device or represents a method to be performed by a computational device. Artificial neural networks may have corresponding structure and/or function in biological neural networks. However, artificial neural networks may provide innovative and useful computational techniques for certain applications in which traditional computational techniques are cumbersome, impractical, or inadequate. Because artificial neural networks can infer a function from observations, such networks are particularly useful in applications where the complexity of the task or data makes the design of the function by conventional techniques burdensome.

One type of artificial neural network is the spiking neural network, which incorporates the concept of time into its operating model, as well as neuronal and synaptic state, thereby providing a rich set of behaviors from which computational function can emerge in the neural network. Spiking neural networks are based on the concept that neurons fire or “spike” at a particular time or times based on the state of the neuron, and that the time is important to neuron function. When a neuron fires, it generates a spike that travels to other neurons, which, in turn, may adjust their states based on the time this spike is received. In other words, information may be encoded in the relative or absolute timing of spikes in the neural network.

SUMMARY

Certain aspects of the present disclosure generally relate to approximating at least a portion of a nonlinear function of a neuron model as a piecewise linear function. Methods and apparatus for implementing the resulting linearized neuron model in one or more artificial neurons, for example, are also provided. Certain aspects of the present disclosure generally relate to a common and flexible architecture for the implementation of the dynamics of neuron models. The design goals include low complexity, accurate modeling of the dynamics, and the ability to implement any neuron model (of one, two, or more dimensions). The piecewise linear approximations provide a simple way to change neuron models within such an architecture, simply by substituting different parameters associated with various neuron models.

Certain aspects of the present disclosure provide a method for operating an artificial neuron. The method generally includes determining that a first state of the artificial neuron is within a first region; determining a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; determining that the second state of the artificial neuron is within a second region; and determining a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.

Certain aspects of the present disclosure provide an apparatus for operating an artificial neuron. The apparatus generally includes a processing system and a memory coupled to the processing system. The processing system is generally configured to determine that a first state of the artificial neuron is within a first region; to determine a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; to determine that the second state of the artificial neuron is within a second region; and to determine a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.

Certain aspects of the present disclosure provide an apparatus for operating an artificial neuron. The apparatus generally includes means for determining that a first state of the artificial neuron is within a first region; means for determining a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; means for determining that the second state of the artificial neuron is within a second region; and means for determining a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.

Certain aspects of the present disclosure provide a computer program product for operating an artificial neuron. The computer program product generally includes a computer-readable medium (e.g., a storage device) having instructions executable to determine that a first state of the artificial neuron is within a first region; to determine a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; to determine that the second state of the artificial neuron is within a second region; and to determine a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.

Certain aspects of the present disclosure provide a method for implementing a combination of a plurality of neuron models in a system of neural processing units. The method generally includes loading parameters for a first neuron model selected from the plurality of neuron models into a first neural processing unit, determining a first state of the first neural processing unit based at least in part on the parameters for the first neuron model, and determining a second state of the first neural processing unit based at least in part on the parameters for the first neuron model and on the first state.

Certain aspects of the present disclosure provide an apparatus for implementing a combination of a plurality of neuron models in a system of neural processing units. The apparatus generally includes a processing system and a memory coupled to the processing system. The processing system is typically configured to load parameters for a first neuron model selected from the plurality of neuron models into a first neural processing unit, to determine a first state of the first neural processing unit based at least in part on the parameters for the first neuron model, and to determine a second state of the first neural processing unit based at least in part on the parameters for the first neuron model and on the first state.

Certain aspects of the present disclosure provide an apparatus for implementing a combination of a plurality of neuron models in a system of neural processing units. The apparatus generally includes means for loading parameters for a first neuron model selected from the plurality of neuron models into a first neural processing unit, means for determining a first state of the first neural processing unit based at least in part on the parameters for the first neuron model, and means for determining a second state of the first neural processing unit based at least in part on the parameters for the first neuron model and on the first state.

Certain aspects of the present disclosure provide a computer program product for implementing a combination of a plurality of neuron models in a system of neural processing units. The computer program product generally includes a (non-transitory) computer-readable medium having instructions executable to load parameters for a first neuron model selected from the plurality of neuron models into a first neural processing unit, to determine a first state of the first neural processing unit based at least in part on the parameters for the first neuron model, and to determine a second state of the first neural processing unit based at least in part on the parameters for the first neuron model and on the first state.

Certain aspects of the present disclosure provide a method for operating an artificial neuron. The method generally includes determining that a first state of the artificial neuron is within a first region; determining a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; determining that the second state of the artificial neuron is within a second region, wherein at least one of the first region or the second region is defined by two or more dimensions; and determining a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.

Certain aspects of the present disclosure provide an apparatus for operating an artificial neuron. The apparatus generally includes a processing system and a memory coupled to the processing system. The processing system is generally configured to determine that a first state of the artificial neuron is within a first region; to determine a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; to determine that the second state of the artificial neuron is within a second region, wherein at least one of the first region or the second region is defined by two or more dimensions; and to determine a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.

Certain aspects of the present disclosure provide an apparatus for operating an artificial neuron. The apparatus generally includes means for determining that a first state of the artificial neuron is within a first region; means for determining a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; means for determining that the second state of the artificial neuron is within a second region, wherein at least one of the first region or the second region is defined by two or more dimensions; and means for determining a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.

Certain aspects of the present disclosure provide a computer program product for operating an artificial neuron. The computer program product generally includes a computer-readable medium (e.g., a storage device or other non-transitory medium) having instructions executable to determine that a first state of the artificial neuron is within a first region; to determine a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; to determine that the second state of the artificial neuron is within a second region, wherein at least one of the first region or the second region is defined by two or more dimensions; and to determine a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.

BRIEF DESCRIPTION OF THE DRAWINGS

So that the manner in which the above-recited features of the present disclosure can be understood in detail, a more particular description, briefly summarized above, may be had by reference to aspects, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only certain typical aspects of this disclosure and are therefore not to be considered limiting of its scope, for the description may admit to other equally effective aspects.

FIG. 1 illustrates an example network of neurons in accordance with certain aspects of the present disclosure.

FIG. 2 illustrates an example processing unit (neuron) of a computational network (neural system or neural network), in accordance with certain aspects of the present disclosure.

FIG. 3 illustrates an example spike-timing dependent plasticity (STDP) curve in accordance with certain aspects of the present disclosure.

FIG. 4 is an example graph of state for an artificial neuron, illustrating a positive regime and a negative regime for defining behavior of the neuron, in accordance with certain aspects of the present disclosure.

FIGS. 5A and 5B illustrate example graphs of membrane voltage v and recovery current u, respectively, versus time for comparing the nonlinear time-varying simple model to an example linearization based on a Taylor expansion method, in accordance with certain aspects of the present disclosure.

FIGS. 6A and 6B illustrate example graphs of membrane voltage v and recovery current u, respectively, versus time for the subthreshold dynamics of the Hunzinger Cold model, in accordance with certain aspects of the present disclosure.

FIG. 7 illustrates a summary of various approaches to piecewise linear neuron modeling, in accordance with certain aspects of the present disclosure.

FIG. 8 illustrates an example of piecewise linear neuron modeling with partitioning in terms of a single dimension, in accordance with certain aspects of the present disclosure.

FIG. 9 illustrates an example of generalized linear neuron modeling with three rectangular regions defined by two dimensions, in accordance with certain aspects of the present disclosure.

FIG. 10 illustrates an example of generalized linear neuron modeling with four regions defined by two dimensions, which may be used to exhibit decaying, sustained, and growing subthreshold oscillation behavior, in accordance with certain aspects of the present disclosure.

FIG. 11 illustrates an example of generalized linear neuron modeling with five regions having varying shapes, in accordance with certain aspects of the present disclosure.

FIGS. 12A-C illustrate example plots of decaying, sustained, and growing subthreshold oscillations, respectively, in accordance with certain aspects of the present disclosure.

FIG. 13 illustrates an example of generalized linear neuron modeling with six regions defined by two dimensions, which may be used for multi-stage decay, multi-stage sustained, and/or multi-stage growth regions to support gradual decaying, multiple sustained oscillations, and/or gradual growing of subthreshold oscillations, in accordance with certain aspects of the present disclosure.

FIG. 14 is a flow diagram of example operations for operating an artificial neuron, in accordance with certain aspects of the present disclosure.

FIG. 14A illustrates example means capable of performing the operations shown in FIG. 14.

FIGS. 15A-D illustrate implementation of a common and flexible neural architecture for a single neural processing unit, where parameters for neuron models can be selected, loaded, accessed, added, deleted, and/or updated, in accordance with certain aspects of the present disclosure.

FIG. 16 is a flow diagram of example operations for implementing a combination of a plurality of neuron models in a system of neural processing units, in accordance with certain aspects of the present disclosure.

FIG. 16A illustrates example means capable of performing the operations shown in FIG. 16.

FIG. 17 illustrates an example implementation for determining states of an artificial neuron using a general-purpose processor, in accordance with certain aspects of the present disclosure.

FIG. 18 illustrates an example implementation for determining states of an artificial neuron where a memory may be interfaced with individual distributed processing units, in accordance with certain aspects of the present disclosure.

FIG. 19 illustrates an example implementation for determining states of an artificial neuron based on distributed memories and distributed processing units, in accordance with certain aspects of the present disclosure.

FIG. 20 illustrates an example implementation of a neural network in accordance with certain aspects of the present disclosure.

FIG. 21 is a block diagram of an example implementation of piecewise linear neuron modeling in which parameters used to update states of an artificial neuron are fetched from memory according to the quantization of the current state, in accordance with certain aspects of the present disclosure.

DETAILED DESCRIPTION

Various aspects of the disclosure are described more fully hereinafter with reference to the accompanying drawings. This disclosure may, however, be embodied in many different forms and should not be construed as limited to any specific structure or function presented throughout this disclosure. Rather, these aspects are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art. Based on the teachings herein one skilled in the art should appreciate that the scope of the disclosure is intended to cover any aspect of the disclosure disclosed herein, whether implemented independently of or combined with any other aspect of the disclosure. For example, an apparatus may be implemented or a method may be practiced using any number of the aspects set forth herein. In addition, the scope of the disclosure is intended to cover such an apparatus or method which is practiced using other structure, functionality, or structure and functionality in addition to or other than the various aspects of the disclosure set forth herein. It should be understood that any aspect of the disclosure disclosed herein may be embodied by one or more elements of a claim.

The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any aspect described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects.

Although particular aspects are described herein, many variations and permutations of these aspects fall within the scope of the disclosure. Although some benefits and advantages of the preferred aspects are mentioned, the scope of the disclosure is not intended to be limited to particular benefits, uses or objectives. Rather, aspects of the disclosure are intended to be broadly applicable to different technologies, system configurations, networks and protocols, some of which are illustrated by way of example in the figures and in the following description of the preferred aspects. The detailed description and drawings are merely illustrative of the disclosure rather than limiting, the scope of the disclosure being defined by the appended claims and equivalents thereof.

An Example Neural System

FIG. 1 illustrates an example neural system 100 with multiple levels of neurons in accordance with certain aspects of the present disclosure. The neural system 100 may comprise a level of neurons 102 connected to another level of neurons 106 though a network of synaptic connections 104 (i.e., feed-forward connections). For simplicity, only two levels of neurons are illustrated in FIG. 1, although fewer or more levels of neurons may exist in a typical neural system. It should be noted that some of the neurons may connect to other neurons of the same layer through lateral connections. Furthermore, some of the neurons may connect back to a neuron of a previous layer through feedback connections.

As illustrated in FIG. 1, each neuron in the level 102 may receive an input signal 108 that may be generated by a plurality of neurons of a previous level (not shown in FIG. 1). The signal 108 may represent an input (e.g., an input current) to the level 102 neuron. Such inputs may be accumulated on the neuron membrane to charge a membrane potential. When the membrane potential reaches its threshold value, the neuron may fire and generate an output spike to be transferred to the next level of neurons (e.g., the level 106). Such behavior can be emulated or simulated in hardware and/or software, including analog and digital implementations.

In biological neurons, the output spike generated when a neuron fires is referred to as an action potential. This electrical signal is a relatively rapid, transient, all-or nothing nerve impulse, having an amplitude of roughly 100 mV and a duration of about 1 ms. In a particular aspect of a neural system having a series of connected neurons (e.g., the transfer of spikes from one level of neurons to another in FIG. 1), every action potential has basically the same amplitude and duration, and thus, the information in the signal is represented only by the frequency and number of spikes (or the time of spikes), not by the amplitude. The information carried by an action potential is determined by the spike, the neuron that spiked, and the time of the spike relative to one or more other spikes.

The transfer of spikes from one level of neurons to another may be achieved through the network of synaptic connections (or simply “synapses”) 104, as illustrated in FIG. 1. The synapses 104 may receive output signals (i.e., spikes) from the level 102 neurons (pre-synaptic neurons relative to the synapses 104). For certain aspects, these signals may be scaled according to adjustable synaptic weights w₁ ^((i,i+1)), . . . , w_(P) ^((i,i+1)) (where P is a total number of synaptic connections between the neurons of levels 102 and 106). For other aspects, the synapses 104 may not apply any synaptic weights. Further, the (scaled) signals may be combined as an input signal of each neuron in the level 106 (post-synaptic neurons relative to the synapses 104). Every neuron in the level 106 may generate output spikes 110 based on the corresponding combined input signal. The output spikes 110 may be then transferred to another level of neurons using another network of synaptic connections (not shown in FIG. 1).

Biological synapses may be classified as either electrical or chemical. While electrical synapses are used primarily to send excitatory signals, chemical synapses can mediate either excitatory or inhibitory (hyperpolarizing) actions in postsynaptic neurons and can also serve to amplify neuronal signals. Excitatory signals typically depolarize the membrane potential (i.e., increase the membrane potential with respect to the resting potential). If enough excitatory signals are received within a certain period to depolarize the membrane potential above a threshold, an action potential occurs in the postsynaptic neuron. In contrast, inhibitory signals generally hyperpolarize (i.e., lower) the membrane potential Inhibitory signals, if strong enough, can counteract the sum of excitatory signals and prevent the membrane potential from reaching threshold. In addition to counteracting synaptic excitation, synaptic inhibition can exert powerful control over spontaneously active neurons. A spontaneously active neuron refers to a neuron that spikes without further input, for example, due to its dynamics or feedback. By suppressing the spontaneous generation of action potentials in these neurons, synaptic inhibition can shape the pattern of firing in a neuron, which is generally referred to as sculpturing. The various synapses 104 may act as any combination of excitatory or inhibitory synapses, depending on the behavior desired.

The neural system 100 may be emulated by a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device (PLD), discrete gate or transistor logic, discrete hardware components, a software module executed by a processor, or any combination thereof. The neural system 100 may be utilized in a large range of applications, such as image and pattern recognition, machine learning, motor control, and the like. Each neuron (or neuron model) in the neural system 100 may be implemented as a neuron circuit. The neuron membrane charged to the threshold value initiating the output spike may be implemented, for example, as a capacitor that integrates an electrical current flowing through it.

In an aspect, the capacitor may be eliminated as the electrical current integrating device of the neuron circuit, and a smaller memristor element may be used in its place. This approach may be applied in neuron circuits, as well as in various other applications where bulky capacitors are utilized as electrical current integrators. In addition, each of the synapses 104 may be implemented based on a memristor element, wherein synaptic weight changes may relate to changes of the memristor resistance. With nanometer feature-sized memristors, the area of neuron circuit and synapses may be substantially reduced, which may make implementation of a very large-scale neural system hardware implementation practical.

Functionality of a neural processor that emulates the neural system 100 may depend on weights of synaptic connections, which may control strengths of connections between neurons. The synaptic weights may be stored in a non-volatile memory in order to preserve functionality of the processor after being powered down. In an aspect, the synaptic weight memory may be implemented on a separate external chip from the main neural processor chip. The synaptic weight memory may be packaged separately from the neural processor chip as a replaceable memory card. This may provide diverse functionalities to the neural processor, wherein a particular functionality may be based on synaptic weights stored in a memory card currently attached to the neural processor.

FIG. 2 illustrates an example 200 of a processing unit (e.g., an artificial neuron 202) of a computational network (e.g., a neural system or a neural network) in accordance with certain aspects of the present disclosure. For example, the neuron 202 may correspond to any of the neurons of levels 102 and 106 from FIG. 1. The neuron 202 may receive multiple input signals 204 ₁-204 _(N) (x₁-x_(N)), which may be signals external to the neural system, or signals generated by other neurons of the same neural system, or both. The input signal may be a current or a voltage, real-valued or complex-valued. The input signal may comprise a numerical value with a fixed-point or a floating-point representation. These input signals may be delivered to the neuron 202 through synaptic connections that scale the signals according to adjustable synaptic weights 206 ₁-206 _(N) (w₁-w_(N)), where N may be a total number of input connections of the neuron 202.

The neuron 202 may combine the scaled input signals and use the combined scaled inputs to generate an output signal 208 (i.e., a signal y). The output signal 208 may be a current, or a voltage, real-valued or complex-valued. The output signal may comprise a numerical value with a fixed-point or a floating-point representation. The output signal 208 may be then transferred as an input signal to other neurons of the same neural system, or as an input signal to the same neuron 202, or as an output of the neural system.

The processing unit (neuron) 202 may be emulated by an electrical circuit, and its input and output connections may be emulated by wires with synaptic circuits. The processing unit 202, its input and output connections may also be emulated by a software code. The processing unit 202 may also be emulated by an electric circuit, whereas its input and output connections may be emulated by a software code. In an aspect, the processing unit 202 in the computational network may comprise an analog electrical circuit. In another aspect, the processing unit 202 may comprise a digital electrical circuit. In yet another aspect, the processing unit 202 may comprise a mixed-signal electrical circuit with both analog and digital components. The computational network may comprise processing units in any of the aforementioned forms. The computational network (neural system or neural network) using such processing units may be utilized in a large range of applications, such as image and pattern recognition, machine learning, motor control, and the like.

During the course of training a neural network, synaptic weights (e.g., the weights w₁ ^((i,i+1)), . . . , w_(P) ^((i,i+1)) from FIG. 1 and/or the weights 206 ₁-206 _(N) from FIG. 2) may be initialized with random values and increased or decreased according to a learning rule. Some examples of the learning rule are the spike-timing-dependent plasticity (STDP) learning rule, the Hebb rule, the Oja rule, the Bienenstock-Copper-Munro (BCM) rule, etc. Very often, the weights may settle to one of two values (i.e., a bimodal distribution of weights). This effect can be utilized to reduce the number of bits per synaptic weight, increase the speed of reading and writing from/to a memory storing the synaptic weights, and to reduce power consumption of the synaptic memory.

Synapse Type

In hardware and software models of neural networks, processing of synapse related functions can be based on synaptic type. Synapse types may comprise non-plastic synapses (no changes of weight and delay), plastic synapses (weight may change), structural delay plastic synapses (weight and delay may change), fully plastic synapses (weight, delay and connectivity may change), and variations thereupon (e.g., delay may change, but no change in weight or connectivity). The advantage of this is that processing can be subdivided. For example, non-plastic synapses may not require plasticity functions to be executed (or waiting for such functions to complete). Similarly, delay and weight plasticity may be subdivided into operations that may operate in together or separately, in sequence or in parallel. Different types of synapses may have different lookup tables or formulas and parameters for each of the different plasticity types that apply. Thus, the methods would access the relevant tables for the synapse's type.

There are further implications of the fact that spike-timing dependent structural plasticity may be executed independently of synaptic plasticity. Structural plasticity may be executed even if there is no change to weight magnitude (e.g., if the weight has reached a minimum or maximum value, or it is not changed due to some other reason) since structural plasticity (i.e., an amount of delay change) may be a direct function of pre-post spike time difference. Alternatively, it may be set as a function of the weight change amount or based on conditions relating to bounds of the weights or weight changes. For example, a synaptic delay may change only when a weight change occurs or if weights reach zero, but not if the weights are maxed out. However, it can be advantageous to have independent functions so that these processes can be parallelized reducing the number and overlap of memory accesses.

Determination of Synaptic Plasticity

Neuroplasticity (or simply “plasticity”) is the capacity of neurons and neural networks in the brain to change their synaptic connections and behavior in response to new information, sensory stimulation, development, damage, or dysfunction. Plasticity is important to learning and memory in biology, as well as to computational neuroscience and neural networks. Various forms of plasticity have been studied, such as synaptic plasticity (e.g., according to the Hebbian theory), spike-timing-dependent plasticity (STDP), non-synaptic plasticity, activity-dependent plasticity, structural plasticity, and homeostatic plasticity.

STDP is a learning process that adjusts the strength of synaptic connections between neurons, such as those in the brain. The connection strengths are adjusted based on the relative timing of a particular neuron's output and received input spikes (i.e., action potentials). Under the STDP process, long-term potentiation (LTP) may occur if an input spike to a certain neuron tends, on average, to occur immediately before that neuron's output spike. Then, that particular input is made somewhat stronger. In contrast, long-term depression (LTD) may occur if an input spike tends, on average, to occur immediately after an output spike. Then, that particular input is made somewhat weaker, hence the name “spike-timing-dependent plasticity.” Consequently, inputs that might be the cause of the post-synaptic neuron's excitation are made even more likely to contribute in the future, whereas inputs that are not the cause of the post-synaptic spike are made less likely to contribute in the future. The process continues until a subset of the initial set of connections remains, while the influence of all others is reduced to zero or near zero.

Since a neuron generally produces an output spike when many of its inputs occur within a brief period (i.e., being sufficiently cumulative to cause the output,), the subset of inputs that typically remains includes those that tended to be correlated in time. In addition, since the inputs that occur before the output spike are strengthened, the inputs that provide the earliest sufficiently cumulative indication of correlation will eventually become the final input to the neuron.

The STDP learning rule may effectively adapt a synaptic weight of a synapse connecting a pre-synaptic neuron to a post-synaptic neuron as a function of time difference between spike time t_(pre) of the pre-synaptic neuron and spike time t_(post) of the post-synaptic neuron (i.e., t=t_(post)−t_(pre)). A typical formulation of the STDP is to increase the synaptic weight (i.e., potentiate the synapse) if the time difference is positive (the pre-synaptic neuron fires before the post-synaptic neuron), and decrease the synaptic weight (i.e., depress the synapse) if the time difference is negative (the post-synaptic neuron fires before the pre-synaptic neuron).

In the STDP process, a change of the synaptic weight over time may be typically achieved using an exponential decay, as given by,

$\begin{matrix} {{\Delta \; {w(t)}} = \left\{ \begin{matrix} {{{a_{+}^{{- t}/k_{+}}} + \mu},} & {t > 0} \\ {{a\_ }^{t/k_{-}},} & {{t < 0},} \end{matrix} \right.} & (1) \end{matrix}$

where k₊ and k⁻ are time constants for positive and negative time difference, respectively, a₊ and a⁻ are corresponding scaling magnitudes, and μ is an offset that may be applied to the positive time difference and/or the negative time difference.

FIG. 3 illustrates an example graph diagram 300 of a synaptic weight change as a function of relative timing of pre-synaptic and post-synaptic spikes in accordance with STDP. If a pre-synaptic neuron fires before a post-synaptic neuron, then a corresponding synaptic weight may be increased, as illustrated in a portion 302 of the graph 300. This weight increase can be referred to as an LTP of the synapse. It can be observed from the graph portion 302 that the amount of LTP may decrease roughly exponentially as a function of the difference between pre-synaptic and post-synaptic spike times. The reverse order of firing may reduce the synaptic weight, as illustrated in a portion 304 of the graph 300, causing an LTD of the synapse.

As illustrated in the graph 300 in FIG. 3, a negative offset μ may be applied to the LTP (causal) portion 302 of the STDP graph. A point of cross-over 306 of the x-axis (y=0) may be configured to coincide with the maximum time lag for considering correlation for causal inputs from layer i−1. In the case of a frame-based input (i.e., an input is in the form of a frame of a particular duration comprising spikes or pulses), the offset value μ can be computed to reflect the frame boundary. A first input spike (pulse) in the frame may be considered to decay over time either as modeled by a post-synaptic potential directly or in terms of the effect on neural state. If a second input spike (pulse) in the frame is considered correlated or relevant of a particular time frame, then the relevant times before and after the frame may be separated at that time frame boundary and treated differently in plasticity terms by offsetting one or more parts of the STDP curve such that the value in the relevant times may be different (e.g., negative for greater than one frame and positive for less than one frame). For example, the negative offset μ may be set to offset LTP such that the curve actually goes below zero at a pre-post time greater than the frame time and it is thus part of LTD instead of LTP.

Neuron Models and Operation

There are some general principles for designing a useful spiking neuron model. A good neuron model may have rich potential behavior in terms of two computational regimes: coincidence detection and functional computation. Moreover, a good neuron model should have two elements to allow temporal coding: arrival time of inputs affects output time and coincidence detection can have a narrow time window. Finally, to be computationally attractive, a good neuron model may have a closed-form solution in continuous time and have stable behavior including near attractors and saddle points. In other words, a useful neuron model is one that is practical and that can be used to model rich, realistic and biologically-consistent behaviors, as well as be used to both engineer and reverse engineer neural circuits.

A neuron model may depend on events, such as an input arrival, output spike or other event whether internal or external. To achieve a rich behavioral repertoire, a state machine that can exhibit complex behaviors may be desired. If the occurrence of an event itself, separate from the input contribution (if any) can influence the state machine and constrain dynamics subsequent to the event, then the future state of the system is not only a function of a state and input, but rather a function of a state, event, and input.

In an aspect, a neuron n may be modeled as a spiking leaky-integrate-and-fire neuron with a membrane voltage v_(n)(t) governed by the following dynamics,

$\begin{matrix} {{\frac{{v_{n}(t)}}{t} = {{\alpha \; {v_{n}(t)}} + {\beta {\sum\limits_{m}{w_{m,n}{y_{m}\left( {t - {\Delta \; t_{m,n}}} \right)}}}}}},} & (2) \end{matrix}$

where α and β are parameters, w_(m,n) is a synaptic weight for the synapse connecting a pre-synaptic neuron m to a post-synaptic neuron n, and y_(m)(t) is the spiking output of the neuron m that may be delayed by dendritic or axonal delay according to Δt_(m,n) until arrival at the neuron n's soma.

It should be noted that there is a delay from the time when sufficient input to a post-synaptic neuron is established until the time when the post-synaptic neuron actually fires. In a dynamic spiking neuron model, such as Izhikevich's simple model, a time delay may be incurred if there is a difference between a depolarization threshold v_(t) and a peak spike voltage v_(peak). For example, in the simple model, neuron soma dynamics can be governed by the pair of differential equations for voltage and recovery, i.e.,

$\begin{matrix} {{\frac{v}{t} = {\left( {{{k\left( {v - v_{t}} \right)}\left( {v - v_{r}} \right)} - u + I} \right)/C}},} & (3) \\ {\frac{u}{t} = {{a\left( {{b\left( {v - v_{r}} \right)} - u} \right)}.}} & (4) \end{matrix}$

where v is a membrane potential, u is a membrane recovery variable, k is a parameter that describes time scale of the membrane potential v, a is a parameter that describes time scale of the recovery variable u, b is a parameter that describes sensitivity of the recovery variable u to the subthreshold fluctuations of the membrane potential v, v_(r) is a membrane resting potential, I is a synaptic current, and C is a membrane's capacitance. In accordance with this model, the neuron is defined to spike when v>v_(peak).

Hunzinger Cold Model

The Hunzinger Cold neuron model is a minimal dual-regime spiking linear dynamical model that can reproduce a rich variety of neural behaviors. The model's one- or two-dimensional linear dynamics can have two regimes, wherein the time constant (and coupling) can depend on the regime. In the subthreshold regime, the time constant, negative by convention, represents leaky channel dynamics generally acting to return a cell to rest in biologically-consistent linear fashion. The time constant in the supra-threshold regime, positive by convention, reflects anti-leaky channel dynamics generally driving a cell to spike while incurring latency in spike-generation.

As illustrated in FIG. 4, the dynamics of the model may be divided into two (or more) regimes. These regimes may be called the negative regime 402 (also interchangeably referred to as the leaky-integrate-and-fire (LIF) regime, not to be confused with the LIF neuron model) and the positive regime 404 (also interchangeably referred to as the anti-leaky-integrate-and-fire (ALIF) regime, not to be confused with the ALIF neuron model). In the negative regime 402, the state tends toward rest (v⁻) at the time of a future event. In this negative regime, the model generally exhibits temporal input detection properties and other subthreshold behavior. In the positive regime 404, the state tends toward a spiking event (v_(s)). In this positive regime, the model exhibits computational properties, such as incurring a latency to spike depending on subsequent input events. Formulation of dynamics in terms of events and separation of the dynamics into these two regimes are fundamental characteristics of the model.

Linear dual-regime bi-dimensional dynamics (for states v and u) may be defined by convention as,

$\begin{matrix} {{\tau_{\rho}\frac{v}{t}} = {v + q_{p}}} & (5) \\ {{{- \tau_{u}}\frac{u}{t}} = {u + r}} & (6) \end{matrix}$

where q_(ρ) and r are the linear transformation variables for coupling.

The symbol ρ is used herein to denote the dynamics regime with the convention to replace the symbol ρ with the sign “−” or “+” for the negative and positive regimes, respectively, when discussing or expressing a relation for a specific regime.

The model state is defined by a membrane potential (voltage) v and recovery current u. In basic form, the regime is essentially determined by the model state. There are subtle, but important aspects of the precise and general definition, but for the moment, consider the model to be in the positive regime 404 if the voltage v is above a threshold (v₊) and otherwise in the negative regime 402.

The regime-dependent time constants include τ⁻ which is the negative regime time constant, and τ₊ which is the positive regime time constant. The recovery current time constant τ_(u) is typically independent of regime. For convenience, the negative regime time constant τ⁻ is typically specified as a negative quantity to reflect decay so that the same expression for voltage evolution may be used as for the positive regime in which the exponent and τ₊ will generally be positive, as will be τ_(u).

The dynamics of the two state elements may be coupled at events by transformations offsetting the states from their null-clines, where the transformation variables are

q _(ρ)=−τ_(ρ) βu−v _(ρ)  (7)

r=δ(v+ε)  (8)

where δ, ε, β and v⁻, v₊ are parameters. The two values for v_(ρ) are the base for reference voltages for the two regimes. The parameter v⁻ is the base voltage for the negative regime, and the membrane potential will generally decay toward v⁻ in the negative regime. The parameter v₊ is the base voltage for the positive regime, and the membrane potential will generally tend away from v₊ in the positive regime.

The null-clines for v and u are given by the negative of the transformation variables q_(ρ) and r, respectively. The parameter δ is a scale factor controlling the slope of the u null-cline. The parameter ε is typically set equal to −v⁻. The parameter β is a resistance value controlling the slope of the v null-clines in both regimes. The τ_(ρ) time-constant parameters control not only the exponential decays, but also the null-cline slopes in each regime separately.

The model is defined to spike when the voltage v reaches a value v_(s). Subsequently, the state is typically reset at a reset event (which technically may be one and the same as the spike event):

v={circumflex over (v)} ⁻  (9)=

u=u+Δu  (10)

where {circumflex over (v)}⁻ and Δu are parameters. The reset voltage {circumflex over (v)}⁻ is typically set to v⁻.

By a principle of momentary coupling, a closed form solution is possible not only for state (and with a single exponential term), but also for the time required to reach a particular state. The close form state solutions are

$\begin{matrix} {{v\left( {t + {\Delta \; t}} \right)} = {{\left( {{v(t)} + q_{\rho}} \right)^{\frac{\Delta \; t}{\tau_{\rho}}}} - q_{\rho}}} & (11) \\ {{u\left( {t + {\Delta \; t}} \right)} = {{\left( {{u(t)} + r} \right)^{- \frac{\Delta \; t}{\tau_{u}}}} - r}} & (12) \end{matrix}$

Therefore, the model state may be updated only upon events such as upon an input (pre-synaptic spike) or output (post-synaptic spike). Operations may also be performed at any particular time (whether or not there is input or output).

Moreover, by the momentary coupling principle, the time of a post-synaptic spike may be anticipated so the time to reach a particular state may be determined in advance without iterative techniques or Numerical Methods (e.g., the Euler numerical method). Given a prior voltage state v₀, the time delay until voltage state v_(f) is reached is given by

$\begin{matrix} {{\Delta \; t} = {\tau_{\rho}\log \frac{v_{f} + q_{\rho}}{v_{0} + q_{\rho}}}} & (13) \end{matrix}$

If a spike is defined as occurring at the time the voltage state v reaches v_(s), then the closed-form solution for the amount of time, or relative delay, until a spike occurs as measured from the time that the voltage is at a given state v is

$\begin{matrix} {{\Delta \; t_{S}} = \left\{ \begin{matrix} {\tau_{+}\log \frac{v_{S} + q_{+}}{v + q_{+}}} & {{{if}\mspace{14mu} v} > {\hat{v}}_{+}} \\ \infty & {otherwise} \end{matrix} \right.} & (14) \end{matrix}$

where {circumflex over (v)}₊ is typically set to parameter v₊, although other variations may be possible.

The above definitions of the model dynamics depend on whether the model is in the positive or negative regime. As mentioned, the coupling and the regime ρ may be computed upon events. For purposes of state propagation, the regime and coupling (transformation) variables may be defined based on the state at the time of the last (prior) event. For purposes of subsequently anticipating spike output time, the regime and coupling variable may be defined based on the state at the time of the next (current) event.

There are several possible implementations of the Cold model, and executing the simulation, emulation or model in time. This includes, for example, event-update, step-event update, and step-update modes. An event update is an update where states are updated based on events or “event update” (at particular moments). A step update is an update when the model is updated at intervals (e.g., 1 ms). This does not necessarily require iterative methods or Numerical methods. An event-based implementation is also possible at a limited time resolution in a step-based simulator by only updating the model if an event occurs at or between steps or by “step-event” update.

Neural Coding

A useful neural network model, such as one composed of the artificial neurons 102, 106 of FIG. 1, may encode information via any of various suitable neural coding schemes, such as coincidence coding, temporal coding or rate coding. In coincidence coding, information is encoded in the coincidence (or temporal proximity) of action potentials (spiking activity) of a neuron population. In temporal coding, a neuron encodes information through the precise timing of action potentials (i.e., spikes) whether in absolute time or relative time. Information may thus be encoded in the relative timing of spikes among a population of neurons. In contrast, rate coding involves coding the neural information in the firing rate or population firing rate.

If a neuron model can perform temporal coding, then it can also perform rate coding (since rate is just a function of timing or inter-spike intervals). To provide for temporal coding, a good neuron model should have two elements: (1) arrival time of inputs affects output time; and (2) coincidence detection can have a narrow time window. Connection delays provide one means to expand coincidence detection to temporal pattern decoding because by appropriately delaying elements of a temporal pattern, the elements may be brought into timing coincidence.

Arrival Time

In a good neuron model, the time of arrival of an input should have an effect on the time of output. A synaptic input—whether a Dirac delta function or a shaped post-synaptic potential (PSP), whether excitatory (EPSP) or inhibitory (IPSP)—has a time of arrival (e.g., the time of the delta function or the start or peak of a step or other input function), which may be referred to as the input time. A neuron output (i.e., a spike) has a time of occurrence (wherever it is measured, e.g., at the soma, at a point along the axon, or at an end of the axon), which may be referred to as the output time. That output time may be the time of the peak of the spike, the start of the spike, or any other time in relation to the output waveform. The overarching principle is that the output time depends on the input time.

One might at first glance think that all neuron models conform to this principle, but this is generally not true. For example, rate-based models do not have this feature. Many spiking models also do not generally conform. A leaky-integrate-and-fire (LIF) model does not fire any faster if there are extra inputs (beyond threshold). Moreover, models that might conform if modeled at very high timing resolution often will not conform when timing resolution is limited, such as to 1 ms steps.

Inputs

An input to a neuron model may include Dirac delta functions, such as inputs as currents, or conductance-based inputs. In the latter case, the contribution to a neuron state may be continuous or state-dependent.

Example Piecewise Linear Neuron Modeling

Mathematical models for the dynamics of a neuron have been sought and studied for decades. A variety of neuron models have been proposed, varying in complexity and the accuracy with which the models match their biological counterparts. Fundamentally, all neuron models attempt to capture the nonlinear behavior of a cell membrane voltage due to the interactions of a large variety of ion channels and have a common starting point, namely the mathematical description provided by the breakthrough work of Hodgkin-Huxley in the 1950s.

Over the years, neuroscientists have converged, in large part, towards two-dimensional neuron models, which appear to provide a good tradeoff between the ability of duplicating the measured behavior of the biological cells they seek to model and the ease and speed with which they can be analyzed and simulated. The most common two-dimensional models, all formulated via a pair of differential equations, are described below.

However, conventional neuron model implementations lack flexibility. Typically, implementation of a neuron model for an artificial neuron, for example, is predicated on selecting a particular neuron model beforehand. The downside to this approach is the difficulty of implementing a completely different or even a slightly modified neuron model.

Certain aspects of the present disclosure take advantage of the fact that the differential equations for various dynamical neuron models may be considered as equivalent, but for the nonlinear function F(v) trying to capture the nonlinear behavior of the cell membrane voltage, as described above. With this realization, one approach includes linearizing, at finite quantization intervals, the nonlinear functions in the differential equations used to model the dynamics of the neurons to provide a piecewise linear approximation. Advantages of such an approach include the ability to derive solutions to the dynamics in either continuous time or discrete time with relative ease and a general mathematical framework whereby any neuron model can be analyzed and simulated. These solutions provide parameters corresponding to each quantization interval for a given neuron model, such that implementation of a different neuron model for certain aspects of the present disclosure may involve a simple substitution of the parameters.

Certain aspects of the present disclosure apply this piecewise linearization approach to a functional that includes the synaptic current. This more generalized approach leads to a system matrix which is a function, among other variables, of the time-varying synaptic conductance. The present disclosure first investigates some approximate solutions to the resulting piecewise linear time-varying system. Next, the present disclosure investigates a piecewise linear time-invariant (LTI) system obtained from the previous time-varying system by approximating the time-varying conductance by a constant over a given time interval. This more precise approach, with a functional that includes the synaptic current, leads to system matrices with a large dynamic range to be covered by the quantization process and therefore to relatively large memory demands to store various pre-calculated matrices. The benefit of this approach is a more accurate approximation of the true dynamics of the original nonlinear time-varying system. An approach to alleviate the memory demands by computing the relevant matrices, rather than storing them, over a portion of the dynamic range is also presented.

Certain aspects of the present disclosure provide a means to realize a common architecture that supports any one-dimensional, two-dimensional, or higher dimensioned neuron models. With this flexible architecture, any of various suitable neuron models may be executed and substituted as desired. For example, the neuron model may include at least one of an Izhikevich simple model, an exponential-integrate-and-fire (EIF) model, a FitzHugh-Nagumo model, a quartic model, or a Hunzinger Cold model as described above and in U.S. patent application Ser. No. 13/483,811 [Atty. Dkt. No. 122024], entitled “Dynamical Event Neuron and Synapse Models for Learning Spiking Neural Networks” and filed May 30, 2012, herein incorporated by reference. Such neuron models may be implemented using the piecewise linear approximation described herein.

Introduction

One place to begin is with the description of the differential equations modeling neuron dynamics. Although the description focuses on two-dimensional neuron models, the approach can be extended to higher dimensional models or applied to one-dimensional models, as well.

$\begin{matrix} {{C\frac{}{t}v} = {{F(v)} - u + I}} & (15) \\ {{\frac{}{t}u} = {a\left( {{b \cdot \left( {v - v_{r}} \right)} - u} \right)}} & (16) \end{matrix}$

The above equations qualitatively describe the dynamics of an artificial neuron (for notational simplicity, the time dependency in the variables is omitted). These equations are the result of simplifications of the Hodgkin-Huxley four dimensional model to two dimensions, represented by the variables v and u. The variable v captures the behavior of the neuron membrane voltage and sodium activation, while u represents an “accommodation” or “recovery” variable attempting to capture the slower behavior of the potassium activation and sodium inactivation, thus reducing the four variables of the Hodgkin-Huxley model to two. The variable I in Eq. (15) represents the input current. A more generic two-dimensional model may be of the form

${C\frac{}{t}v} = {{F\left( {v,u} \right)} + I}$ ${\frac{}{t}u} = {G\left( {v,u} \right)}$

where both differential equations may contain nonlinear terms. Here, the focus is on models such as those described by Eqs. (15) and (16), but the same methodology developed throughout can be applied to the above description, as well.

Fundamentally, the most popular neuron models that have been suggested in the literature differ by the choice of the function F(v) in Eq. (15). Some examples include a quadratic function, as suggested by Izhikevich (also referred as the simple model):

F(v)=k(v−v _(r))(v−v _(t))  (17)

a linear-plus-exponential function, per Brette and Gerstner:

$\begin{matrix} {{F(v)} = {{g_{L} \cdot \Delta \cdot ^{\frac{v - v_{t}}{\Delta}}} + {g_{L} \cdot \left( {E_{L} - v} \right)}}} & (18) \end{matrix}$

a linear-plus-cubic function representing the FitzHugh-Nagumo model:

$\begin{matrix} {{F(v)} = {v - {\frac{1}{3}v^{3}}}} & (19) \end{matrix}$

a linear-plus-quartic term, referred to as the quartic model, per Touboul and Gerstner

F(v)=2a·v+v ⁴  (20)

and finally what may be referred to as “intrinsic conductance” models, defined as

F(v)=G(v)·v+p(v)  (21)

where G(v) is a piecewise constant function (in units of conductance) and p(v) is also a piecewise constant function (in units of current). The simplest form of an intrinsic conductance model is obtained when G(v) and p(v) are piecewise constant over just two intervals, as in the Hunzinger Cold model described above, for which F(v) takes on the following form:

$\begin{matrix} {{F(v)} = \left\{ \begin{matrix} {\left. {{\frac{C}{\tau_{-}}\left( {v - v_{r}} \right)\mspace{14mu} {if}\mspace{14mu} v} \leq v_{t}}\Rightarrow{G(v)} \right. = {{\frac{C}{\tau_{-}}\mspace{14mu} {and}\mspace{14mu} {p(v)}} = {{- \frac{C}{\tau_{-}}}v_{r}}}} \\ {\left. {{\frac{C}{\tau_{+}}\left( {v - v_{t}} \right)\mspace{14mu} {if}\mspace{14mu} v} > v_{t}}\Rightarrow{G(v)} \right. = {{\frac{C}{\tau_{+}}\mspace{14mu} {and}\mspace{14mu} {p(v)}} = {{- \frac{C}{\tau_{+}}}v_{t}}}} \end{matrix} \right.} & (22) \end{matrix}$

All models above, with the exception of the FitzHugh-Nagumo model, are referred to as two-dimensional hybrid models because, in addition to the description given by Eqs. (15) and (16), reset conditions are given. These are provided in such models, for example, because the variable v will grow to infinity once a voltage threshold is crossed. Therefore the following reset conditions may be used:

If v>v _(peak), then v→v _(r) and u→u+d  (23)

In other words, when the voltage v crosses a spiking threshold v_(peak) (or, for certain aspects, a determination is made that the voltage will cross v_(peak)), the voltage is reset to a resting value v_(r) and the recovery variable u is reset to a value equal to the present value plus a constant d. For certain aspects, u may be reset to a predetermined constant value (u_(reset)), instead of u+d. According to certain aspects, a reset condition may occur in response to activation or reception of a control signal. The reset condition in the hybrid models enriches the possible behaviors of two-dimensional dynamical systems.

Most generally, the input current I(t) is modeled by a combination of synaptic currents I_(SYN)(t) and a generic current I_(ext)(t). The synaptic current takes on the form

$\begin{matrix} {{I_{SYN}(t)} = {\sum\limits_{i}{{g_{i}(t)} \cdot \left\lbrack {E_{i} - {v(t)}} \right\rbrack}}} & (24) \end{matrix}$

In Eq. (24), g_(i)(t) indicates the time-dependent conductance for a particular channel (the i^(th) channel), and E_(i) indicates the reversal potential for that channel. Although a synaptic current of the form above is sufficient to describe substantially linear current-voltage relationships, in some cases (e.g., the N-methyl-D-aspartate (NMDA) channel), the conductance is also a function of the post-synaptic membrane voltage. In this case Eq. (24) takes on a more complex form, namely

I _(NMDA)(t)=g _(NMDA)(t)·h(v)[E _(NMDA) −v(t)]  (25)

with the function h(v) capturing the dependence on the post-synaptic voltage. The function h(v) is modeled as

h(v)≡1/(1+βe ^(−α·v))  (26)

with the parameters α and β taking on the following values, for example: α=0.062 and β=1/3.57.

Therefore, most generally, up to L different synaptic channels may be modeled as follows:

$\begin{matrix} {{{I_{SYN}(t)} = {\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i}\left( {v(t)} \right)}\left( {E_{i} - {v(t)}} \right)}}}{where}} & (27) \\ {{h_{i}\left( {v(t)} \right)} = {\frac{1}{1 + {\beta_{i}^{\alpha \cdot {v{(t)}}}}}\mspace{14mu} {with}\mspace{14mu} \left\{ \begin{matrix} {\beta_{i} = \beta} & {{{if}\mspace{14mu} i} = {N\; M\; D\; A}} \\ {\beta_{i} = 0} & {otherwise} \end{matrix} \right.}} & (28) \end{matrix}$

Additionally, the time-dependent conductance g_(i)(t) can be modeled by a simple exponential function, an alpha function, or by a difference-of-exponentials function. In the case of a simple decaying exponential with time constant τ where θ(t) is the Heaviside step function, one has

$\begin{matrix} {{g_{i}(t)} = {g_{i}^{- \frac{t}{\tau_{i}}}{\theta (t)}}} & (29) \end{matrix}$

In the case of an alpha function, one has

$\begin{matrix} {{g_{i}(t)} = {g_{i}\frac{t}{\tau_{i}}^{1 - \frac{t}{\tau_{i}}}{\theta (t)}}} & (30) \end{matrix}$

In the case of a difference-of-exponentials function, the exponentials having differing rise and decay time constants, one has

$\begin{matrix} {{g_{i}(t)} = {{{\overset{\_}{g}}_{i}\left( {^{- \frac{t}{\tau_{decay}}} - ^{- \frac{t}{\tau_{rise}}}} \right)}{\theta (t)}}} & (31) \end{matrix}$

The constant g _(i) contains a normalization factor such that the peak is equal to g_(i) as follows:

$\begin{matrix} {{{\overset{\_}{g}}_{i} = \frac{g_{i}}{^{- \frac{t_{peak}}{\tau_{decay}}} - ^{- \frac{t_{peak}}{\tau_{rise}}}}}{where}} & (32) \\ {t_{peak} = {\frac{\tau_{decay} \cdot \tau_{rise}}{\tau_{decay} - \tau_{rise}} \cdot {\ln \left( \frac{\tau_{decay}}{\tau_{rise}} \right)}}} & (33) \end{matrix}$

In the next sections, approximations to the solution of the dynamical system are explored. Since the system is nonlinear, exact solutions cannot be found. Therefore when referring to or comparing to the “exact” solution (as in Example 1), what is meant is a solution obtained numerically (e.g., Runge-Kutta), but with great precision.

Formulation and Derivation

Before proceeding with the derivation, some definitions and notation conventions are introduced. Henceforth, boldface capital letters denote matrices, whereas boldface lowercase letters denote vectors. A two-dimensional state vector x may be defined as

$\begin{matrix} {x \equiv \begin{bmatrix} v \\ u \end{bmatrix}} & (34) \end{matrix}$

The first state variable is the membrane voltage v, and the second state variable is the recovery variable u. Eqs. (15) and (16) are now rewritten explicitly for the most general case as follows:

$\begin{matrix} {{C\frac{}{t}{v(t)}} = {{F\left( {v(t)} \right)} - {u(t)} + {\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i}\left( {v(t)} \right)}\left( {E_{i} - {v(t)}} \right)}} + {I_{ext}(t)}}} & (35) \\ {{\frac{}{t}{u(t)}} = {{{abv}(t)} - {{au}(t)} - {abv}_{r}}} & (36) \end{matrix}$

Therefore, in the most general case, one is dealing with a nonlinear time-varying (NLTV) two-dimensional dynamical system, as illustrated at 702 in FIG. 7. In the following, such a system is first approximated by a piecewise linear time-varying (pLTV) system at 706 and is successively further approximated as either: (1) a piecewise linear time-invariant system (pLTI) with constant coefficients that are time-interval dependent at 710 or (2) a pLTI with constant coefficients that are time-interval independent at 714.

Piecewise Linear Time-Varying System

First the time axis tε[0,∞] is divided into arbitrary non-overlapping time intervals, namely

{tε[T _(n) ,T _(n+1) ], n=0,1,2,3, . . . }  (37)

Within each time interval (e.g., the n^(th) interval), the neuron behavior is approximated by a linear time-varying (LTV) system whose parameters are obtained from the state of the artificial neuron at the start of the interval (e.g., at time t=T_(n)). In order to develop such an approximation, first define

$\begin{matrix} {{\Gamma \left( {v,t} \right)} \equiv {\frac{1}{C}\left\{ {{F\left( {v(t)} \right)} + {\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i}\left( {v(t)} \right)}\left( {E_{i} - {v(t)}} \right)}} + {I_{ext}(t)}} \right\}}} & (38) \end{matrix}$

and the system of Eqs. (35) and (36) becomes

$\begin{matrix} {{\frac{}{t}{v(t)}} = {{\Gamma \left( {v,t} \right)} + {a_{12}{u(t)}}}} & (39) \\ {{\frac{}{t}{u(t)}} = {{a_{21}{v(t)}} + {a_{22}{u(t)}} + b_{2}}} & (40) \end{matrix}$

Next, the function F(v,t) is approximated with an approximate, affine-linear expression over the interval tε[T_(n),T_(n+1)]. The coefficients in the approximation are a function of the voltage at time T_(n). To simplify notations when unequivocal, denote v(T_(n))

v_(n) such that

Γ(v,t)≅a ₁₁ [v _(n) ,t]v(t)+b ₁ [v _(n) ,t]  (41)

Some examples of such approximations include the Taylor expansion method, the average slope method, the first order linear interpolation method, and the optimal linear interpolation method minimizing the L_(p) approximation error. For the Taylor expansion method:

$\begin{matrix} {\left. {{\Gamma \left( {v,t} \right)} \cong {{\Gamma \left( {{v\left( T_{n} \right)},t} \right)} + \frac{\partial{\Gamma \left( {v,t} \right)}}{\partial v}}} \middle| {}_{v{(T_{n})}}\left( {{v(t)} - {v\left( T_{n} \right)}} \right) \right.\left. {{a_{11}\left\lbrack {v_{n},t} \right\rbrack} \equiv \frac{\partial{\Gamma \left( {v,t} \right)}}{\partial v}} \middle| {}_{v_{n}}\mspace{14mu} {and} \right.{{b_{1}\left\lbrack {v_{n},t} \right\rbrack} \equiv {{\Gamma \left( {v_{n},t} \right)} - {{a_{11}\left\lbrack {v_{n},t} \right\rbrack}v_{n}}}}} & \left( {41a} \right) \end{matrix}$

For a given voltage step Δv_(n) in the average slope method, the average slope is computed as follows:

$\begin{matrix} {{{a_{11}\left\lbrack {v_{n},t} \right\rbrack} \equiv \frac{{\Gamma \left( {{{v\left( T_{n} \right)} + {\Delta \; v_{n}}},t} \right)} - {\Gamma \left( {{v\left( T_{n} \right)},t} \right)}}{\Delta \; v_{n}}}{{b_{1}\left\lbrack {v_{n},t} \right\rbrack} \equiv {{\Gamma \left( {v_{n},t} \right)} - {{a_{11}\left\lbrack {v_{n},t} \right\rbrack}v_{n}}}}} & \left( {41b} \right) \end{matrix}$

In the first-order linear interpolation method, the voltage axis is partitioned into intervals, vε[V_(k),V_(k+1)], k=0, 1, 2, . . . with V_(k)≦v(T_(n))≦V_(k+1). Then

$\begin{matrix} {{{a_{11}\left\lbrack {{v\left( T_{n} \right)},t} \right\rbrack} \equiv {\frac{{\Gamma \left( {V_{k + 1},t} \right)} - {\Gamma \left( {V_{k},t} \right)}}{V_{k + 1} - V_{k}}\mspace{14mu} {and}}}{{b_{1}\left\lbrack {v_{n},t} \right\rbrack} \equiv {{\Gamma \left( {v_{n},t} \right)} - {{a_{11}\left\lbrack {v_{n},t} \right\rbrack}v_{n}}}}} & \left( {41c} \right) \end{matrix}$

In the optimal linear interpolation method minimizing the L_(p) approximation error, the voltage axis is, as before, partitioned into intervals, vε[V_(k),V_(k+1)], k=0, 1, 2, . . . . However, the linear approximation

{circumflex over (Γ)}(v,t)=a ₁₁ [v _(n) ,t]v(t)+b ₁ [v _(n) ,t]

is designed to minimize a linear approximation error with respect to the original function based on an L_(p) norm. The approximation error over the interval vε[V_(k), V_(k+1)] may be defined as

${ɛ_{p,n,t}\left( {{a_{11}\left\lbrack {v_{n},t} \right\rbrack},{b_{1}\left\lbrack {v_{n},t} \right\rbrack}} \right)} = \left\lbrack {\int_{V_{k}}^{V_{k + 1}}{{{{\Gamma \left( {v,t} \right)} - {\hat{\Gamma}\left( {v,t} \right)}}}^{p}\ {v}}} \right\rbrack^{\frac{1}{p}}$ where Γ̂(v, t) = a₁₁[v_(n), t]v(t) + b₁[v_(n), t]

Based on Eq. (41), the LTV system described by Eqs. (39) and (40) may now be expressed as follows:

$\begin{matrix} {{\frac{}{t}{v(t)}} = {{{a_{11}\left\lbrack {v_{n},t} \right\rbrack}{v(t)}} + {a_{12}{u(t)}} + {b_{1}\left\lbrack {v_{n},t} \right\rbrack}}} & (42) \\ {{\frac{}{t}{u(t)}} = {{a_{21}{v(t)}} + {a_{22}{u(t)}} + b_{2}}} & (43) \end{matrix}$

More compactly, one has the matrix equation

$\begin{matrix} {{\overset{.}{x}(t)} = {{{A\left( {v_{n},t} \right)}{x(t)}} + {b\left( {v_{n},t} \right)}}} & (44) \\ {{\overset{.}{x}(t)} = {{\begin{bmatrix} {a_{11}\left\lbrack {v_{n},t} \right\rbrack} & a_{12} \\ a_{21} & a_{22} \end{bmatrix}{x(t)}} + \begin{bmatrix} {b_{1}\left\lbrack {v_{n},t} \right\rbrack} \\ b_{2} \end{bmatrix}}} & (45) \end{matrix}$

where a₁₂=−1/C, a₂₁=ab, a₂₂=−a, and b₂=−abv_(r).

The solution of the LTV system above, for tε[T_(n),T_(n+1)], may be expressed as

$\begin{matrix} {{x(t)} = {{{\Phi \left( {t,T_{n}} \right)}{x\left( T_{n} \right)}} + {\int_{T_{n}}^{t}{{\Phi \left( {\tau,T_{n}} \right)}{b\left( {v_{n},\tau} \right)}\ {\tau}}}}} & (46) \end{matrix}$

where the transition matrix Φ(t,T_(n)) is given by the Peano-Baker formula, namely

$\begin{matrix} \begin{matrix} {{\Phi \left( {t,T_{n}} \right)} = {I + {\int_{T_{n}}^{t}{{A\left( {v_{n},t_{0}} \right)}{t_{0}}}} + {\int_{T_{n}}^{t}{{{A\left( {v_{n},t_{0}} \right)}\left\lbrack {\int_{T_{n}}^{t_{0}}{{A\left( {v_{n},t_{1}} \right)}{t_{1}}}} \right\rbrack}{t_{0}}}} +}} \\ {{{\int_{T_{n}}^{t}{{{A\left( {v_{n},t_{0}} \right)}\left\lbrack {\int_{T_{n}}^{t_{0}}{{{A\left( {v_{n},t_{1}} \right)}\left\lbrack {\int_{T_{n}}^{t_{1}}{{A\left( {v_{n},t_{2}} \right)}{t_{2}}}} \right\rbrack}{t_{1}}}} \right\rbrack}{t_{0}}}} + \ldots}} \end{matrix} & (47) \end{matrix}$

The series given in Eq. (47) simplifies for some specific cases, for example:

-   -   (i) A(v_(n), t) is constant and equal to A_(n). Then Φ(t,T_(n))         takes on the familiar form of a matrix exponential, namely

Φ(t,T _(n))=e ^(A) ^(n) ^((t-T) ^(n) ⁾

-   -   -   where the matrix exponential of a matrix A is defined as

$^{A} = {I + A + \frac{A^{2}}{2!} + \frac{A^{3}}{3!} + \ldots}$

-   -   (ii) A more general case is when A(v_(n), t) and

∫_(T_(n))^(t)A(v_(n), τ)τ

commute for any t. Then

Φ(t, T_(n)) = exp [∫_(T_(n))^(t)A(v_(n), τ)τ]

Any of the following conditions guarantees that the above commutative property is satisfied: (a) A(v_(n),t) is constant; (b) A(v_(n),t)=a(t)M, where a(t) is a scalar function and M is a constant matrix; or (c) A(v_(n),t)=Σa_(i)(t)M_(i) where a_(i)(t) is a scalar function and M_(i)M_(j)=M_(j)M_(i) are constant matrices that commute for any i,j.

-   -   (iii) A somewhat more general case is when for all         tε[T_(n),T_(n+1)], the matrix A(v_(n),t) can be expressed as a         sum of two components:

${A\left( {v_{n},t} \right)} = {{{A_{k}\left( {v_{n},\tau,t_{c}} \right)}\left( {t - t_{c}} \right)^{k}} + {{A_{k + s}\left( {v_{n},\tau,t_{c}} \right)}\left\lbrack \frac{\left( {t - t_{c}} \right)^{k + 1} - \left( {\tau - t_{c}} \right)^{k + 1}}{k + 1} \right\rbrack}^{s}}$

-   -   -   for some integers k≧0 and s≧1, some fixed time-instants             t_(c)≦τ≦t, and some fixed matrices A_(k)(v_(n), τ, t_(c))             and A_(k+s)(v_(n), τ, t_(c)). The time-instants and matrices             are “fixed” in the sense that they are independent of the             time parameter tε[T_(n),T_(n−1)]. Perhaps the most useful             example is when k=0 and s=1 or 2. In any case, if the second             term in the above expression (i.e., the term involving the             matrix A_(k+s)(v_(n), τ, t_(c))) is much smaller than the             first term for all tε[T_(n),T_(n+1)], then it turns out that             the matrix Φ(t,T_(n)) may be approximated by the following             infinite series:

${\Phi \left( {t,T_{n}} \right)} = {{\exp \left\lbrack {{A_{k}\left( {v_{n},\tau,t_{c}} \right)}\frac{\left( {t - t_{c}} \right)^{k + 1} - \left( {\tau - t_{c}} \right)^{k + 1}}{k + 1}} \right\rbrack} + {\sum\limits_{m = 0}^{\infty}{{A_{k}^{m}\left( {v_{n},\tau,t_{c}} \right)}{A_{k + s}\left( {v_{n},\tau,t_{c}} \right)}{G_{m,k,s}\left( {{A_{k}\left( {v_{n},\tau,t_{c}} \right)},\left( {t - t_{c}} \right),\left( {\tau - t_{c}} \right)} \right)}}}}$

where a function G_(m,k,s)(z,t,τ) of a complex variable z and real-valued parameters t and τ is defined. The function G_(m,k,s)(z,t,τ) is analytic at z=0 and is given by

${G_{m,k,s}\left( {z,t,\tau} \right)} \equiv {\langle{\frac{\partial^{k + s}}{\partial z^{k + s}}\left( {z^{- {({m + 1})}}{\exp \left\lbrack {z\; \frac{t^{k + 1} - \tau^{k + 1}}{k + 1}} \right\rbrack}} \right)}\rangle}$

where the notation <f(z)> denotes the analytical component of f(z). In the above equation, the analytical component is obtained by replacing the exponential term with its power series representation, computing the product and derivative, and then dropping terms associated with negative powers of z.

For all other cases of time-varying matrix A(v_(n),t), approximations to the transition matrix of Eq. (47) can be found, and then approximate solutions to Eq. (46) may be obtained.

Piecewise Linear Time-Invariant System

Further simplifications may be achieved by transforming the linear time varying (LTV) system described by Eq. (44) into a linear time-invariant (LTI) system. In order to do so, the coefficient a₁₁[v_(n),t] is held constant over the interval tε[T_(n),T_(n+1)]. This result may be achieved in several ways, a few of which are described below. For each of the affine-linear approximations described above, the constant coefficient may be defined as follows:

a ₁₁ [v _(n) ,t]≡a ₁₁ [v _(n) ,T _(n)]

for any interval tε[T_(n),T_(n+1)].

Alternatively, if the value of the next time step T_(n+1) is known at time t=T_(n), the average value of the coefficient a₁₁[v_(n),t] may be calculated as follows:

${a_{11}\left\lbrack {v_{n},t} \right\rbrack} \equiv {\frac{1}{T_{n + 1} - T_{n}}{\int_{T_{n}}^{T_{n + 1}}{{a_{11}\left\lbrack {v_{n},\tau} \right\rbrack}{\tau}}}}$

for any interval tε[T_(n),T_(n+1)].

To clarify with an example for the Taylor expansion method, an LTI system is obtained by using

$\left. {{a_{11}\left\lbrack {v_{n},T_{n}} \right\rbrack} \equiv \frac{\partial{\Gamma \left( {v,T_{n}} \right)}}{\partial v}} \middle| {}_{v_{n}}{or} \right.$ $\left. {{a_{11}\left\lbrack {v_{n},T_{n}} \right\rbrack} \equiv {\frac{1}{T_{n + 1} - T_{n}}{\int_{T_{n}}^{T_{n + 1}}\frac{\partial{\Gamma \left( {v,t} \right)}}{\partial v}}}} \middle| {}_{v_{n}}{t} \right.$

The same averaging approach may be applied to any of the methods described above. The LTI system is now described by the following matrix equation:

$\begin{matrix} {{\overset{.}{x}(t)} = {{\begin{bmatrix} {a_{11}\left\lbrack {v_{n},T_{n}} \right\rbrack} & a_{12} \\ a_{21} & a_{22} \end{bmatrix}{x(t)}} + \begin{bmatrix} {b_{1}\left\lbrack {v_{n},t} \right\rbrack} \\ b_{2} \end{bmatrix}}} & (48) \end{matrix}$

The solution may be expressed as

$\begin{matrix} {{x(t)} = {{{\Phi \left( {t,T_{n}} \right)}{x\left( T_{n} \right)}} + {\int_{T_{n}}^{t}{{\Phi \left( {{T_{n} + t - \tau},T_{n}} \right)}{b\left( {v_{n},\tau} \right)}{\tau}}}}} & (49) \end{matrix}$

where the transition matrix Φ(t,T_(n)) is now the matrix exponential

Φ(t,T _(n))=e ^(A(v) ^(n) ^(,T) ^(n) ^()(t-T) ^(n) ⁾  (50)

For the case in which T_(n)=nT (i.e., fixed and uniform time intervals of length T), Eq. (49) becomes

$\begin{matrix} {{x\left( {{n\; T} + T} \right)} = {{^{{A{({v_{n},{n\; T}})}}T}{x\left( {n\; T} \right)}} + {\int_{n\; T}^{{n\; T} + T}{^{{A{({v_{n},{n\; T}})}}{({{n\; T} + T - \tau})}}{b\left( {v_{n},\tau} \right)}{\tau}}}}} & (51) \end{matrix}$

In summary, the initial general model is a nonlinear time-varying two-dimensional system. This nonlinear system was first transformed into a linear time-varying system by applying linear approximations to the nonlinear functional Γ(v,t) over a given time interval. The time-varying system was further transformed into a linear time-invariant (LTI) system by taking the time-varying system matrix A(v_(n), t) and approximating it with a constant matrix A_(n) over the same given interval.

Solutions

Now that the problem has been formulated and a number of possible affine linear approximations to the nonlinear functional have been proposed, the focus now is on the solution to the LTI system over the interval tε[T_(n),T_(n+1)] given by Eqs. (49) and (51) and their implementation. Further simplifying the notations in Eq. (49) and denoting A(v_(n), T_(n))=A_(n),

$\begin{matrix} {{x(t)} = {{^{A_{n}{({t - T_{n}})}}{x\left( T_{n} \right)}} + {\int_{T_{n}}^{t}{^{A_{n}{({t - \tau})}}{b\left( {v_{n},\tau} \right)}{\tau}}}}} & (52) \end{matrix}$

and the matrix A(v_(n),T_(n)) and vector b(v_(n),t) are given by

${\begin{matrix} {{A_{n} = \begin{bmatrix} {a_{11}\left\lbrack {v_{n},T_{n}} \right\rbrack} & a_{12} \\ a_{21} & a_{22} \end{bmatrix}},} & b \end{matrix}\left( {v_{n},t} \right)} = \begin{bmatrix} {b_{1}\left\lbrack {v_{n},t} \right\rbrack} \\ b_{2} \end{bmatrix}$

where the coefficients a₁₁[v_(n),T_(n)] and b₁[v_(n),t] are calculated by any of the methods described above.

Next, the solution for the Taylor expansion method is derived (the solutions for any of the other methods follow accordingly). In this case, one has

$\begin{matrix} {\left. {{a_{11}\left\lbrack {v_{n},T_{n}} \right\rbrack} \equiv \frac{\partial{\Gamma \left( {v,T_{n}} \right)}}{\partial v}} \middle| {}_{v_{n}}\mspace{14mu} {{{and}\mspace{14mu} {b_{1}\left\lbrack {v_{n},t} \right\rbrack}} \equiv {{\Gamma \left( {v_{n},t} \right)} - {{a_{11}\left\lbrack {v_{n},T_{n}} \right\rbrack}v_{n}}}} \right.\mspace{20mu} {and}} & (53) \\ {\mspace{79mu} {{\Gamma \left( {v_{n},t} \right)} \equiv {\frac{1}{C}\left\{ {{F\left( v_{n} \right)} + {\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i}\left( v_{n} \right)}\left( {E_{i} - v_{n}} \right)}} + {I_{ext}(t)}} \right\}}}} & (54) \\ {\left. {{a_{11}\left\lbrack {v_{n},T_{n}} \right\rbrack} \equiv \frac{\partial{\Gamma \left( {v,T_{n}} \right)}}{\partial v}} \right|_{v_{n}} = \left. {\frac{1}{C}\frac{\partial{F(v)}}{\partial v}} \middle| {}_{v_{n}}{{+ \frac{1}{C}}{\sum\limits_{i = 1}^{L}{{g_{i}\left( T_{n} \right)}\left\lbrack \frac{\partial{h_{i}(v)}}{\partial v} \middle| {}_{v_{n}}{\left( {E_{i} - v_{n}} \right) - {h_{i}\left( v_{n} \right)}} \right\rbrack}}} \right.} & (55) \end{matrix}$

Simplifying notations,

$\begin{matrix} {{a_{11}\left\lbrack {v_{n},T_{n}} \right\rbrack} = {{\frac{1}{C}{F^{\prime}\left( v_{n} \right)}} + {\frac{1}{C}{\sum\limits_{i = 1}^{L}{{g_{i}\left( T_{n} \right)}\left\lbrack {{{h_{i}^{\prime}\left( v_{n} \right)}\left( {E_{i} - v_{n}} \right)} - {h_{i}\left( v_{n} \right)}} \right\rbrack}}}}} & (56) \end{matrix}$

It is convenient to express the vector b(v_(n), t) as follows:

$\begin{matrix} {{b\left( {v_{n},t} \right)} = \begin{bmatrix} {b_{1}\left\lbrack {v_{n},t} \right\rbrack} \\ b_{2} \end{bmatrix}} \\ {= {\begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix} + \begin{bmatrix} {b_{1}(t)} \\ 0 \end{bmatrix} + \begin{bmatrix} {\frac{1}{C}{I_{ext}(t)}} \\ 0 \end{bmatrix}}} \end{matrix}$ ${{where}\begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}} = \begin{bmatrix} {\frac{1}{C}\left\{ {{F\left( v_{n} \right)} - {{a_{11}\left\lbrack {v_{n},T_{n}} \right\rbrack}v_{n}}} \right\}} \\ b_{2} \end{bmatrix}$ ${{and}\begin{bmatrix} {b_{1}(t)} \\ 0 \end{bmatrix}} = \begin{bmatrix} {\frac{1}{C}\left\{ {\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i}\left( v_{n} \right)}\left( {E_{i} - v_{n}} \right)}} \right\}} \\ 0 \end{bmatrix}$

Eq. (52) may then be expressed as

$\begin{matrix} {{x(t)} = {{^{A_{n}{({t - T_{n}})}}{x\left( T_{n} \right)}} + {\int\limits_{T_{n}}^{t}{^{A_{n}{({t - \tau})}}{{\tau \begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}}}}} + {\int\limits_{T_{n}}^{t}{{^{A_{n}{({t - \tau})}}\begin{bmatrix} {b_{1}(t)} \\ 0 \end{bmatrix}}{\tau}}} + {\int\limits_{T_{n}}^{t}{{^{A_{n}{({t - \tau})}}\begin{bmatrix} {\frac{1}{C}{I_{ext}(t)}} \\ 0 \end{bmatrix}}{\tau}}}}} & (57) \end{matrix}$

The first integral of Eq. (57) may be solved in closed form, such that one obtains

$\begin{matrix} {{\int\limits_{T_{n}}^{t}{^{A_{n}{({t - \tau})}}{{\tau \begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}}}}} = {{A_{n}^{- 1}\left( {^{A_{n}{({t - T_{n}})}} - I} \right)}\begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}}} & (58) \end{matrix}$

where I is the 2×2 identity matrix.

Eq. (52) may now be expressed as follows:

$\begin{matrix} {{x(t)} = {{^{A_{n}{({t - T_{n}})}}x\left( T_{n} \right)} + {{A_{n}^{- 1}\left( {^{A_{n}{({t - T_{n}})}} - I} \right)}\begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}} + {\int\limits_{T_{n}}^{t}{^{A_{n}{({t - \tau})}}{b_{1}(\tau)}{{\tau \begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}} + {\int\limits_{T_{n}}^{t}{^{A_{n}{({t - \tau})}}\frac{1}{C}{I_{ext}(\tau)}{{\tau \begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}}}} & (59) \end{matrix}$

If the external current is such that closed-form expression for the last integral of Eq. (59) cannot be obtained, it may have to be approximated. One example of an approximation is the zero-hold, namely

$\begin{matrix} {{{\int\limits_{T_{n}}^{t}{^{A_{n}{({t - \tau})}}\frac{1}{C}{I_{ext}(\tau)}{{\tau \begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}} \cong {\frac{1}{C}{I_{ext}\left( T_{n} \right)}{\int\limits_{T_{n}}^{t}{^{A_{n}{({t - \tau})}}{{\tau \begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}}}} = {\frac{1}{C}{I_{ext}\left( T_{n} \right)}{{A_{n}^{- 1}\left( {^{A_{n}{({t - T_{n}})}} - I} \right)}\begin{bmatrix} 1 \\ 0 \end{bmatrix}}}} & (60) \end{matrix}$

In this case, the closed-form solution for any interval tε[T_(n),T_(n+1)] takes on the following form:

$\begin{matrix} {{x(t)} = {{^{A_{n}{({t - T_{n}})}}x\left( T_{n} \right)} + {{A_{n}^{- 1}\left( {^{A_{n}{({t - T_{n}})}} - I} \right)}\begin{bmatrix} {b_{0} + {\frac{1}{C}{I_{ext}\left( T_{n} \right)}}} \\ b_{2} \end{bmatrix}} + {\int\limits_{T_{n}}^{t}{^{A_{n}{({t - \tau})}}{b_{1}(\tau)}{{\tau \begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}}}} & (61) \end{matrix}$

A key ingredient in Eq. (61) is the matrix exponential e^(A) ^(n) ^(t), which can be expressed as follows. Let λ_(n1) and λ_(n2) be the eigenvalues of the 2×2 matrix A_(n). Then

$\begin{matrix} {{^{A_{n}t} = {{^{\lambda_{n\; 1}t}I} + {\frac{^{\lambda_{n\; 1}t} - ^{\lambda_{n\; 2}t}}{\lambda_{n\; 1} - \lambda_{n\; 2}}\left( {A_{n} - {\lambda_{n\; 1}I}} \right)}}}{for}{\lambda_{n\; 1} \neq {\lambda_{n\; 2}\mspace{14mu} {real}}}} & (62) \\ {{^{A_{n}t} = {{^{\lambda_{n\; 1}t}I} + {{te}^{\lambda_{n\; 1}t}\left( {A_{n} - {\lambda_{n\; 1}I}} \right)}}}{for}{\lambda_{n\; 1} = {\lambda_{n\; 2}\mspace{14mu} {real}}}} & (63) \\ {{^{A_{n}t} = {{^{\alpha \; t}\cos \; \beta \; t\; I} + {\frac{^{\alpha t}\sin \; \beta \; t}{\beta}\left( {A_{n} - {\alpha \; I}} \right)}}}{for}\begin{matrix} {\lambda_{n\; 1} = \lambda_{n\; 2}^{*}} \\ {= {\alpha + {\beta}}} \end{matrix}{\beta > 0}} & (64) \end{matrix}$

where λ_(n1) and λ_(n2) are the solutions of the characteristic equation det(A_(n)−λI)=0.

Eqs. (62)-(64) give explicit expressions for the matrix exponential.

Alternatively, a large number of efficient numerical algorithms are available to compute the matrix exponential. Therefore, it is feasible to determine the state of the system at time t=T_(n+1) through either method. But in a hardware implementation, it may be beneficial to use a different approach, as described next.

First, notice that in the matrix A_(n), only one coefficient a₁₁[v_(n),T_(n)] changes as the system evolves; the remaining three coefficients remain constant throughout. The coefficient is given, for example, by Eq. (56). An example efficient procedure is as follows: (1) quantize the first state variable (i.e., the membrane voltage v_(n)) at each time to step to a finite number of values and (2) index lookup tables with pre-calculated values of the functions F′(v_(n)), h′_(i)(v_(n)), and h_(i)(v_(n)). Similarly, time instants may be quantized, as well, and pre-calculated values of g_(i)(T_(n)) may be stored in lookup tables. The retrieved values may now be used to evaluate a₁₁[v_(n),T_(n)] via Eq. (56) and to quantize the result to a finite number of values Q(a₁₁[v_(n),T_(n)]).

Similarly, a number of choices for ΔT_(n) may be pre-selected, and the matrix exponential and the matrix inverse of the matrices appearing in Eq. (62) may be pre-calculated and addressed by Q(a₁₁[v_(n),T_(n)]) and ΔT_(n).

Adaptive and Fixed Time Steps

In the previous section, the expressions for the state of the LTI system were derived at arbitrary time instants. The following describes in more detail the case where the time steps are chosen adaptively and the simpler case of a synchronous system where the time instants are uniform with a fixed and predetermined step size ΔT_(n)=T.

An adaptive strategy may be beneficial both with respect to complexity and precision. For example, time steps may be chosen farther apart (i.e., larger ΔT_(n)) when the state is evolving slowly, thus increasing the speed of computations. In contrast, the time steps may be made small when, for example, the neuron model is near a spiking event, thereby increasing the precision with which the spike time is calculated. Next, a possible algorithm for the choice of the time steps is described.

As Eq. (63) shows, the time constants of the system evolution are inversely proportional to the eigenvalues of the matrices A_(n). In particular, if the eigenvalues are close to zero, then the time constants are large, and the system evolves slowly. If, on the contrary, at least one of the eigenvalues becomes large (and possibly positive), the system evolves very rapidly. One example algorithm for the choice of the time steps that accomplishes the above task is the following:

$\begin{matrix} {T_{n + 1} = {T + {\min \left( {\frac{\ln \; \mu_{n}}{\lambda_{n,\max}},{\Delta \; T_{\max}}} \right)}}} & (65) \end{matrix}$

In Eq. (65), λ_(n,max) denotes the maximum eigenvalue (in magnitude) of the matrix A_(n), while ΔT_(max) and μ_(n) are configurable parameters. This ensures that the following relationships hold:

λ_(n,max) ≦|a ₁₁ [v(T _(n)),T _(n) ]|+|a ₂₂ |, T _(n+1) −T _(n) ≦ΔT _(max)  (66)

and for any interval tε[T_(n),T_(n+1)]

∥x(t)∥≦μ_(n) ∥x(T _(n))∥  (67)

Next, the general solutions of the previous section are specialized for the important case of fixed and uniform time steps of size T. Starting with Eq. (61), one obtains

$\begin{matrix} {{x\left( {{nT} + T} \right)} = {{^{A_{n}T}{x({nT})}} + {{A_{n}^{- 1}\left( {^{A_{n}T} - I} \right)}\begin{bmatrix} {b_{0} + {\frac{1}{C}{I_{ext}({nT})}}} \\ b_{2} \end{bmatrix}} + {\int_{0}^{T}{^{A_{n}t}{b_{1}\left( {{nT} + T - t} \right)}\ {{t\begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}}}} & (68) \end{matrix}$

Example 1 Taylor Expansion for the Izhikevich (Simple) Model

In this example, Eq. (68) is evaluated for the simple model and linearization based on the Taylor expansion method. To simplify the formulas somewhat, it is assumed that the external current is not present.

First, the coefficients of the Taylor expansion for the simple model, i.e., F(v)=(k(v−v_(r))(v−v_(t)), are derived starting from Eq. (56). Provided that

$\begin{matrix} {{{\frac{1}{C}\frac{\partial{F(v)}}{\partial v}}_{v_{n}}} = {{\frac{2k}{C}v_{n}} - {\frac{k}{C}\left( {v_{r} + v_{t}} \right)}}} & (69) \end{matrix}$

one obtains

$\begin{matrix} {{a_{11}\left\lbrack {v_{n},{nT}} \right\rbrack} = {{\frac{2k}{C}v_{n}} - {\frac{k}{C}\left( {v_{r} + v_{t}} \right)} + {\frac{1}{C}{\sum\limits_{i = 1}^{L}{{g_{i}({nT})}\left\lbrack {{{h_{i}^{\prime}\left( v_{n} \right)}\left( {E_{i} - v} \right)} - {h_{i}\left( v_{n} \right)}} \right\rbrack}}}}} & (70) \\ \begin{matrix} {{b_{1}\left\lbrack {v_{n},t} \right\rbrack} = {{\Gamma \left( {v_{n},t} \right)} - {{a_{11}\left\lbrack {v_{n},{nT}} \right\rbrack}v_{n}}}} \\ {= {{\frac{1}{C}\left\{ {{{k\left( {v_{n} - v_{r}} \right)}\left( {v_{n} - v_{t}} \right)} + {\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i}\left( v_{n} \right)}\left( {E_{i} - v_{n}} \right)}}} \right\}} -}} \\ {\begin{Bmatrix} {{\frac{2k}{C}v_{n}^{2}} - {\frac{k}{C}\left( {v_{r} + v_{t}} \right)v_{n}} + {\frac{1}{C}{\sum\limits_{i = 1}^{L}{g_{i}({nT})}}}} \\ {\left\lbrack {{h_{i}^{\prime}\left( v_{n} \right)\left( {E_{i} - v_{n}} \right)} - {h_{i}\left( v_{n} \right)}} \right\rbrack v_{n}} \end{Bmatrix}} \end{matrix} & (71) \end{matrix}$

For non-NMDA synaptic channels, Eqs. (70) and (71) simplify to

$\begin{matrix} {\mspace{79mu} {{a_{11}\left\lbrack {v_{n},{nT}} \right\rbrack} = {{\frac{2k}{C}v_{n}} - {\frac{k}{C}\left( {v_{r} + v_{t}} \right)} - {\frac{1}{C}{\sum\limits_{i = 1}^{L}{g_{i}({nT})}}}}}} & (72) \\ {{b_{1}\left\lbrack {v_{n},{nT}} \right\rbrack} = {{\frac{1}{C}\left\{ {{- {kv}_{n}^{2}} + {{kv}_{r}v_{t}} + {\sum\limits_{i = 1}^{L}{{g_{i}({nT})}v_{n}}}} \right\}} + {\frac{1}{C}{\sum\limits_{i = 1}^{L}{{g_{i}(t)}\left( {E_{i} - v_{n}} \right)}}}}} & (73) \end{matrix}$

Taking

$b_{0} = {\frac{1}{C}\left\{ {{- {kv}_{n}^{2}} + {{kv}_{r}v_{t}} + {\sum\limits_{i = 1}^{L}{{{g_{i}({nT})}\left\lbrack {{{h_{i}^{\prime}\left( v_{n} \right)}\left( {E_{i} - v_{n}} \right)} - {h_{i}\left( v_{n} \right)}} \right\rbrack}v_{n}}}} \right\}}$

Eq. (68) now becomes

$\begin{matrix} {{{x\left( {{nT} + T} \right)} = {{^{A_{n}T}{x({nT})}} + {{A_{n}^{- 1}\left( {^{A_{n}T} - I} \right)}\begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}} + {\sum\limits_{i = 1}^{L}{\left\lbrack {{h_{i}\left( v_{n} \right)}\left( {E_{i} - v_{n}} \right)} \right\rbrack {\int\limits_{0}^{T}{^{A_{n}\tau}{g_{i}\left( {{nT} + T - \tau} \right)}{{\tau \begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}}}}}}\mspace{79mu} {with}\mspace{85mu} {A_{n} = {{\begin{bmatrix} \begin{matrix} {{\frac{2k}{C}v_{n}} - {\frac{k}{C}\left( {v_{r} + v_{t}} \right)} + {\frac{1}{C}{\sum\limits_{i = 1}^{L}{g_{i}({nT})}}}} \\ \left\lbrack {{h_{i}^{\prime}\left( v_{n} \right)\left( {E_{i} - v_{n}} \right)} - {h_{i}\left( v_{n} \right)}} \right\rbrack \end{matrix} & {- \frac{1}{C}} \\ {ab} & {- a} \end{bmatrix}\mspace{85mu}\begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}} = \begin{bmatrix} {\frac{1}{C}\begin{Bmatrix} {{- {kv}_{n}^{2}} + {{kv}_{r}v_{t}} + {\sum\limits_{i = 1}^{L}{g_{i}({nT})}}} \\ {\left\lbrack {{h_{i}^{\prime}\left( v_{n} \right)\left( {E_{i} - v_{n}} \right)} - {h_{i}\left( v_{n} \right)}} \right\rbrack v_{n}} \end{Bmatrix}} \\ {- {abv}_{r}} \end{bmatrix}}}} & (74) \end{matrix}$

Once again for non-NMDA synaptic currents, Eq. (74) simplifies to

$\begin{matrix} {{{x\left( {{n\; T} + T} \right)} = {{^{A_{n}T}{x\left( {n\; T} \right)}} + {{A_{n}^{- 1}\left( {^{A_{n}T} - I} \right)}\begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}} + {\sum\limits_{i = 1}^{L}{E_{i}{\int_{0}^{T}{^{A_{n}\tau}{g_{i}\left( {{n\; T} + T - \tau} \right)}\ {{\tau \begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}}}}}}\mspace{79mu} {with}\mspace{79mu} {A_{n} = {{\begin{bmatrix} {{\frac{2k}{C}v_{n}} - {\frac{k}{C}\left( {v_{r} + v_{t}} \right)} - {\frac{1}{C}{\sum\limits_{i = 1}^{L}{g_{i}\left( {n\; T} \right)}}}} & {- \frac{1}{C}} \\ {ab} & {- a} \end{bmatrix}\mspace{79mu}\begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}} = \begin{bmatrix} {\frac{1}{C}\left\{ {{{- k}\; v_{n}^{2}} + {k\; v_{r}v_{t}} + {\sum\limits_{i = 1}^{L}{{g_{i}\left( {n\; T} \right)}v_{n}}}} \right\}} \\ {{- {ab}}\; v_{r}} \end{bmatrix}}}} & (75) \end{matrix}$

Furthermore, the integrals in Eqs. (74) and (75) can be solved in closed form. For example, if

g _(i)(t)=g _(i) e ^(−t/τ) ^(i) θ(t)

then

$\begin{matrix} {{\int_{0}^{T}{^{A_{n}\tau}{g_{i}\left( {{n\; T} + T - \tau} \right)}\ {\tau}}} = {{g_{i}\left( {{n\; T} + T} \right)}\ \left( {^{A_{n}} + {\tau_{i}^{- 1}I}} \right)^{- 1}\left( {^{{({A_{n} + {\tau_{i}^{- 1}I}})}T} - I} \right)}} & (76) \end{matrix}$

To complete the example, the accuracy of Eq. (75) is tested with T=1 ms for a slow excitatory neuron model with parameters k=0.7, C=100, a=0.03, b=−2, v_(r)=−60 mV, and v_(t)=−40 mV and a single exponential AMPA channel with parameters τ_(AMPA)=5 ms, E_(AMPA)=0 mV, and g_(AMPA)=5. As illustrated in the membrane potential plot 500 and the recovery current plot 520 of FIGS. 5A and 5B, respectively, the linearization based on Eq. (75) accurately tracks the plots based on the nonlinear time-varying model.

Example 2 Subthreshold Dynamics of the Hunzinger Cold Model

Another example is developed in an effort to examine the subthreshold dynamics of the simple intrinsic conductance model known as the Hunzinger Cold model. In this example, no synaptic currents and the simple, but interesting case of impulsive external current are assumed.

In the Hunzinger Cold model (see Eq. (22) above) when the membrane voltage is below threshold, the matrix, A_(n) is constant and equal to A⁻:

$A_{-} \equiv \begin{bmatrix} {{- 1}/{\tau\_}} & {{- 1}/C} \\ {a\; b} & {- a} \end{bmatrix}$

The derivation can be further simplified if the first state variable is defined as the membrane voltage minus the reference voltage. With such a definition, all the constant terms are equal to zero, and Eq. (61) simplifies to

$\begin{matrix} {{x(t)} = {{^{A_{-}{({t - T_{n}})}}{x\left( T_{n} \right)}} + {\frac{1}{C}{\int_{T_{n}}^{t}{^{A_{-}{({t - \tau})}}{I_{ext}(\tau)}\ {{\tau \begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}}}}} & (77) \end{matrix}$

Furthermore, if the external current is assumed to be a Dirac delta function at time T_(n) with amplitude I, i.e., I_(ext) (t)=Iδ(t−T_(n)), then

$\begin{matrix} {{x(t)} = {^{A_{-}{({t - T_{n}})}}\left( {{x\left( T_{n} \right)} + {\frac{1}{C}\begin{bmatrix} 1 \\ 0 \end{bmatrix}}} \right)}} & (78) \end{matrix}$

Note that impulsive inputs have the same effect on the system as that of an initial condition. If the eigenvalues are real and λ₁≠λ₂, Eq. (62) may be substituted in Eq. (78) to obtain the following continuous time solution for v<v_(t):

$\begin{matrix} {{x(t)} = {\left\lbrack {{^{\lambda_{1}{({t - T_{n}})}}I} + {\frac{^{\lambda_{1}{({t - T_{n}})}} - ^{\lambda_{2}{({t - T_{n}})}}}{\lambda_{1} - \lambda_{2}}\left( {A - {\lambda_{1}I}} \right)}} \right\rbrack \left( {{x\left( T_{n} \right)} + {\frac{I}{C}\begin{bmatrix} 1 \\ 0 \end{bmatrix}}} \right)}} & (79) \end{matrix}$

By defining a new matrix

${\overset{\_}{A}}_{-} = \frac{\left( {A_{-} - {\lambda_{1}I}} \right)}{\lambda_{1} - \lambda_{2}}$

and denoting

${{x\left( T_{n} \right)} + {\frac{I}{C}\begin{bmatrix} 1 \\ 0 \end{bmatrix}}} = \begin{bmatrix} v_{n} \\ u_{n} \end{bmatrix}$

Eq. (72) may be written as

$\begin{matrix} {{x(t)} = {\left\lbrack {{^{\lambda_{1}{({t - T_{n}})}}\left( {I + {\overset{\_}{A}}_{-}} \right)} - {^{\lambda_{2}{({t - T_{n}})}}{\overset{\_}{A}}_{-}}} \right\rbrack \begin{bmatrix} v_{n} \\ u_{n} \end{bmatrix}}} & (80) \end{matrix}$

In particular for T_(n)=0, one obtains

$\begin{matrix} {{x(t)} = {\left\lbrack {{^{\lambda_{1}t}\left( {I + {\overset{\_}{A}}_{-}} \right)} - {^{\lambda_{2}t}{\overset{\_}{A}}_{-}}} \right\rbrack \begin{bmatrix} {v_{0} + {I/C}} \\ u_{0} \end{bmatrix}}} & (81) \end{matrix}$

The membrane potential plot 600 and the recovery current plot 620 of FIGS. 6A and 6B, respectively, show the time evolution of Eq. (81) for the following values of the parameters: τ⁻=14 ms, C=100, a=0.03, b=−2, I_(ext)(t)=100δ(t), and v₀=u₀=0. The membrane voltage and recovery current are given by the following functions:

v(t)−v _(r)=0.8228e ^(−0.0827t)+0.1771e ^(−0.0186t)  (82)

u(t)=0.9351e ^(−0.08277t)−0.9351e ^(−0.0186t)  (83)

Since the matrices and eigenvalues involved in the computation of Eq. (80) are known a priori, the time course of the system may be calculated very easily and with the desired precision by pre-calculating and storing (e.g., in a look-up table) the two exponential functions with a given time resolution. Alternatively, fast algorithms for the computation (approximation) of the exponential function may be employed, and Eq. (80) may be computed in real time.

The above formulation is particularly relevant in an event-based implementation where it is of interest to compute the state vector at the time of an event. For instance given Eq. (80) and the occurrence of an event at time T_(n+1), one may wish to compute T_(n+1) ⁻. With Δ_(n)≡T_(n+1)−T_(n), one has

$\begin{matrix} {{x\left( T_{n + 1}^{-} \right)} = {\left\lbrack {{^{\lambda_{1}\Delta_{n}}\left( {I + {\overset{\_}{A}}_{-}} \right)} - {^{\lambda_{2}\Delta_{n}}{\overset{\_}{A}}_{-}}} \right\rbrack \begin{bmatrix} v_{n} \\ u_{n} \end{bmatrix}}} & (84) \end{matrix}$

One important event is the spike time (i.e. the time at which the artificial neuron's membrane voltage crosses a peak threshold, as described above). When the model for the artificial neuron is close to the spike time, at least one of the eigenvalues is positive and dominant. Therefore, a good approximation may be achieved by retaining only the dominant term in the expression of the voltage. In other words, since the function v(t) is of the form shown in Eq. (82), i.e.,

v(t)=+c ₂ e ^(λ) ¹ ^(t) +c ₂ e ^(λ) ² ^(t)  (85)

v(t) may be approximated by its dominant term, i.e.,

v(t)≅c ₁ e ^(λ) ¹ ^(t) +c ₂  (86)

The spiking time may be easily obtained from

$\begin{matrix} {t_{spike} \cong {\frac{1}{\lambda_{1}}{\ln \left( {\left( {v_{peak} - c_{2}} \right)/c_{1}} \right)}}} & (87) \end{matrix}$

Additional Simplifications

The end of the subsection entitled “Solutions” mentions that in order to pre-calculate the matrix exponential and matrix inverse, the first element a₁₁[v_(n),T_(n)] of the matrix A_(n) should be quantized to a finite number of values that cover the dynamic range. As seen from the derivations of the previous subsection and specifically from Example 1, the coefficient a₁₁[v_(n),T_(n)] is a function of v_(n) and of the conductance at time T_(n). Although the dynamic range of the membrane voltage is fairly limited, the dynamic range of the conductance can be very large. Therefore, a large number of pre-calculated matrices may most likely have to be stored in this case. Next, further simplifications are explored in order to reduce the memory demands. One approach is that of pre-computing and storing the desired matrices over a limited range and performing calculations to approximate the desired matrices for values beyond that range.

For example, when the coefficient a₁₁[v_(n),T_(n)] becomes much larger (in magnitude) than the other three fixed coefficients of the matrix A_(n), the following approximation may be used:

$\begin{matrix} {{\psi (A)} \cong {{{\frac{1}{\left( {a_{11} - a_{22}} \right)^{2} + {a_{12}a_{21}}}\begin{bmatrix} {a_{11} - a_{22}} & {- a_{12}} \\ a_{21} & {a_{11} - a_{22}} \end{bmatrix}}\begin{bmatrix} {\psi \left( \gamma_{1} \right)} & 0 \\ 0 & {\psi \left( \gamma_{2} \right)} \end{bmatrix}}{\quad{{\begin{bmatrix} {a_{11} - a_{22}} & a_{12} \\ {- a_{21}} & {a_{11} - a_{22}} \end{bmatrix}\mspace{79mu} \gamma_{1}} = {{a_{11} + {\frac{a_{12}a_{21}}{a_{11} - a_{22}}\mspace{14mu} {and}\mspace{14mu} \gamma_{2}}} = {a_{22} - \frac{a_{12}a_{21}}{a_{11} - a_{22}}}}}}}} & (88) \end{matrix}$

for any complex-valued function ψ(•), such as ψ(x)=e^(x) and ψ(x)=x⁻¹. With this approach, memory demands and computational complexity can be traded off

Further reduction of the memory demands may be accomplished via certain approximations. For example, an affine linear approximation may be applied to a revised functional Γ(v,t)=Γ(v)≡1/C F(v)) rather than that defined by Eq. (38). Additionally, the synaptic current may be treated as an external current, and the resulting integral may be approximated by a backward rectangular rule. In this case, the dynamic range involved for pre-calculating and storing the matrix exponential and matrix inverse is that of the membrane voltage alone and is, therefore, quite small. The tradeoff is one of memory demands versus accuracy of the solutions.

Next, the paragraph above is explained in more detail by re-deriving the solution under this additional simplification. One may begin as before with Eqs. (35) and (36), repeated here for convenience:

$\begin{matrix} {{C\frac{}{t}{v(t)}} = {{F\left( {v(t)} \right)} - {u(t)} + {\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i\;}\left( {v(t)} \right)}\left( {E_{i} - {v(t)}} \right)}} + {I_{ext}(t)}}} & (89) \\ {{\frac{}{t}{u(t)}} = {{{abv}(t)} - {{au}(t)} - {abv}_{r}}} & (90) \end{matrix}$

Now, however, the functional in Eq. (38) is modified as follows:

$\begin{matrix} {{\Gamma \left( {v,t} \right)} = {{\Gamma (v)} \equiv {\frac{1}{C}{F\left( {v(t)} \right)}}}} & (91) \end{matrix}$

and the system of equations is reformulated as

$\begin{matrix} {{\frac{}{t}{v(t)}} = {{\Gamma (v)} + {a_{12}{u(t)}} + {\frac{1}{C}\begin{Bmatrix} {{\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i}\left( {v(t)} \right)}\left( {E_{i} - {v(t)}} \right)}} +} \\ {I_{ext}(t)} \end{Bmatrix}}}} & (92) \\ {{\frac{}{t}{u(t)}} = {{a_{21}{v(t)}} + {a_{22}{u(t)}} + b_{2}}} & (93) \end{matrix}$

The system matrix A_(n) now simplifies to

$\begin{matrix} {A_{n} \equiv \begin{bmatrix} {a_{11}\left\lbrack v_{n} \right\rbrack} & a_{12} \\ a_{21} & a_{22} \end{bmatrix}} & (94) \end{matrix}$

with the vector b(v_(n), t) is now defined as

$\begin{matrix} {{b\left( {v_{n},t} \right)} = {\begin{bmatrix} {b_{1}\left\lbrack {v_{n},t} \right\rbrack} \\ b_{2} \end{bmatrix} = \begin{bmatrix} {\frac{1}{C}\begin{Bmatrix} {{\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i}\left( v_{n} \right)}\left( {E_{i} - v_{n}} \right)}} +} \\ {I_{ext}(t)} \end{Bmatrix}} \\ b_{2} \end{bmatrix}}} & (95) \end{matrix}$

With the above approximation, the system matrix (coefficient a₁₁) dependence on the conductance values is avoided, thus considerably reducing the dynamic range to be covered in computing the matrix exponential. The synaptic current may be treated as an external current by holding the membrane voltage to a constant value for the time period. In a fixed-time-step implementation, the solution would then be

x(nT+T)=e ^(A) ^(n) ^(T) x(nT)+∫_(nT) ^(nT+T) e ^(A) ^(n) ^((nT+T−τ)) b(v _(n),τ)dτ  (96)

The first component of the vector integral in Eq. (96) is

$\begin{matrix} {\int_{nT}^{{nT} + T}{e^{A_{n}{({{nT} + T - \tau})}}\frac{1}{C}\begin{Bmatrix} {{\sum\limits_{i = 1}^{L}{{g_{i}(t)}{h_{i}\left( v_{n} \right)}\left( {E_{i} - v_{n}} \right)}} +} \\ {I_{ext}(t)} \end{Bmatrix}{\tau}}} & (97) \end{matrix}$

which can be solved in most cases of interest. The best results for the above approximation have been obtained by using a backward rectangular rule, namely using the value v_(n)=v(nT+T) in Eq. (97).

Example 3 Approximation with a Backward Rectangular Rule

To simplify the exposition and notations, this example assumes that the synaptic current does not contain voltage-dependent conductance channels (e.g., NMDA channels) and that there is no external current I_(ext)(t). The derivation is obtained for fixed step sizes of length T. To begin, Eq. (68) may be simplified as follows:

$\begin{matrix} {{x\left( {{nT} + T} \right)} = {{e^{A_{n}T}{x({nT})}} + q + {\frac{1}{C}{\int_{0}^{T}{e^{A_{n}\tau}{\sum\limits_{i = 1}^{L}{{g_{i}\left( {{nT} + T - \tau} \right)}\left( {E_{i} - {v\left( {{nT} + T} \right)}} \right){{\tau \begin{bmatrix} 1 \\ 0 \end{bmatrix}}}}}}}}}} & (98) \end{matrix}$

where the vector q contains constant terms, namely

$\begin{matrix} {q = {{A_{n}^{- 1}\left( {e^{A_{n}T} - I} \right)}\begin{bmatrix} b_{0} \\ b_{2} \end{bmatrix}}} & (99) \end{matrix}$

For notational convenience, the following vector and matrix may also be defined:

$\begin{matrix} {{b \equiv \begin{bmatrix} 1 \\ 0 \end{bmatrix}}{B \equiv \begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix}}} & (100) \end{matrix}$

such that Eq. (98) may be rewritten as

$\begin{matrix} {{x\left( {{nT} + T} \right)} = {{e^{A_{n}T}{x({nT})}} + q + {\frac{1}{C}{\int_{0}^{T}{e^{A_{n}\tau}{\sum\limits_{i = 1}^{L}{{g_{i}\left( {{nT} + T - \tau} \right)}E_{i}{\tau}\; b}}}}} - {\frac{1}{C}{\int_{0}^{T}{e^{A_{n}\tau}{\sum\limits_{i = 1}^{L}{{g_{i}\left( {{nT} - T - \tau} \right)}{\tau}\; {B \cdot {x\left( {{nT} + T} \right)}}}}}}} + q}} & (101) \end{matrix}$

Now, the solution is derived for g_(i)(t) modeled as simple exponentials per Eq. (29). In this case, one has

$\begin{matrix} {{x\left( {{nT} + T} \right)} = {{e^{A_{n}T}{x({nT})}} + {\frac{1}{C}{\sum\limits_{i = 1}^{L}{{g_{i}({nT})}E_{i}{\int_{0}^{T}{e^{A_{n}\tau}e^{{- {({T - \tau})}}/\tau_{i}}{{\tau} \cdot b}}}}}} - {\frac{1}{C}{\sum\limits_{i = 1}^{L}{{g_{i}({nT})}{\int_{0}^{T}{e^{A_{n}\tau}e^{{- {({T - \tau})}}/\tau_{i}}{\tau}\; {B \cdot {x\left( {{nT} + T} \right)}}}}}}} + q}} & (102) \end{matrix}$

The integrals can be readily solved, and if one further defines

$\begin{matrix} {{{H_{i} \equiv {\int_{0}^{T}{e^{A \cdot \sigma}e^{\frac{\sigma - T}{\tau_{i}}}{\sigma}}}} = \begin{bmatrix} h_{11}^{i} & h_{12}^{i} \\ h_{21}^{i} & h_{22}^{i} \end{bmatrix}},{{h_{i} \equiv {H_{i} \cdot b}} = \begin{bmatrix} h_{11}^{i} \\ h_{21}^{i} \end{bmatrix}}} & (103) \end{matrix}$

then Eq. (102) may be written as

$\begin{matrix} {{x\left( {{nT} + T} \right)} = {{e^{A \cdot T}{x({nT})}} + {\sum\limits_{i}{\frac{E_{i}{g_{i}({nT})}}{C} \cdot h_{i}}} - {\sum\limits_{i}{{\frac{g_{i}({nT})}{C} \cdot H_{i}}{B \cdot {x\left( {{nT} + T} \right)}}}} + q}} & (104) \end{matrix}$

Collecting terms containing the state at time n T+T on the left-hand side leads to

$\begin{matrix} {{\left\lbrack {I + {\sum\limits_{i}{\frac{g_{i}({nT})}{C} \cdot H_{i} \cdot B}}} \right\rbrack \cdot {x\left( {{nT} + T} \right)}} = {{e^{A \cdot T}{x({nT})}} + {\sum\limits_{i}{\frac{E_{i}{g_{i}({nT})}}{C} \cdot h_{i}}} + q}} & (105) \end{matrix}$

and finally

$\begin{matrix} {{\cdot {x\left( {{nT} + T} \right)}} = {\left\lbrack {I + {\sum\limits_{i}{\frac{g_{i}({nT})}{C} \cdot H_{i} \cdot B}}} \right\rbrack^{- 1} \cdot \begin{Bmatrix} {{e^{A \cdot T}{x({nT})}} +} \\ {{\sum\limits_{i}{\frac{E_{i}{g_{i}({nT})}}{C} \cdot h_{i}}} + q} \end{Bmatrix}}} & (106) \end{matrix}$

Notice that the matrix to be inverted is

$\begin{matrix} {{{\left\lbrack {I + {\sum\limits_{i}{\frac{g_{i}({nT})}{C} \cdot H_{i} \cdot B}}} \right\rbrack = {{\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} + {\sum\limits_{i}{\frac{g_{i}({nT})}{C} \cdot \begin{bmatrix} h_{11}^{i} & 0 \\ h_{21}^{i} & 0 \end{bmatrix}}}} =}}\quad}\left\lbrack \begin{matrix} {1 + {\sum\limits_{i}{h_{11}^{i}\frac{g_{i}({nT})}{C}}}} & 0 \\ {\sum\limits_{i}{h_{21}^{i}\frac{g_{i}({nT})}{C}}} & 1 \end{matrix} \right\rbrack} & (107) \end{matrix}$

and that its inverse is

$\begin{matrix} {{{\left\lbrack {I + {\sum\limits_{i}{\frac{g_{i}({nT})}{C} \cdot H_{i} \cdot B}}} \right\rbrack^{- 1} = {\frac{1}{\Delta}\begin{bmatrix} 1 & 0 \\ {- {\sum\limits_{i}{h_{21}^{i}\frac{g_{i}({nT})}{C}}}} & \Delta \end{bmatrix}}},{where}}{\Delta = {1 + {\sum\limits_{i}{h_{11}^{i}\frac{g_{i}({nT})}{C}}}}}} & (108) \end{matrix}$

The computation of the state update may proceed as follows (where e^(A·T≡G):)

-   -   I. Pre-calculate with the desired quantization and store all         coefficients (G, h_(i), and q).     -   II. For each channel, calculate h₁₁ ^(i)g_(i)(nT)/C and h₂₁         ^(i)g_(i)(nT)/C.     -   III. Calculate the sums and scaled-by-E_(i) sums

${\sum\limits_{i}\frac{E_{i}h_{11}^{i}{g_{i}({nT})}}{C}},{\sum\limits_{i}\frac{h_{11}^{i}{g_{i}({nT})}}{C}},{\sum\limits_{i}\frac{E_{i}h_{21}^{i}{g_{i}({nT})}}{C}},{\sum\limits_{i}\frac{h_{21}^{i}{g_{i}({nT})}}{C}}$

-   -   IV. Evaluate the right-hand side of Eq. (105) and store in         auxiliary variables, i.e.,

${\begin{bmatrix} g_{11} & g_{12} \\ g_{21} & g_{22} \end{bmatrix}\begin{bmatrix} {v({nT})} \\ {u({nT})} \end{bmatrix}} + \begin{bmatrix} \frac{E_{i}h_{11}^{i}{g_{i}({nT})}}{C} \\ \frac{E_{i}h_{21}^{i}{g_{i}({nT})}}{C} \end{bmatrix} + \begin{bmatrix} q_{1} \\ q_{2} \end{bmatrix}$ ${auxv} = {{g_{11}{v({nT})}} + {g_{12}{u({nT})}} + {\sum\limits_{i}\frac{E_{i}h_{11}^{i}{g_{i}({nT})}}{C}} + q_{1}}$ ${auxu} = {{g_{21}{v({nT})}} + {g_{22}{u({nT})}} + {\sum\limits_{i}\frac{E_{i}h_{21}^{i}{g_{i}({nT})}}{C}} + q_{2}}$

-   -   V. Perform the multiplication by the inverse matrix:

${{v({nT})} + T} = {\frac{auxv}{\Delta} = \frac{auxv}{1 + {\sum\limits_{i}\frac{h_{11}^{i}{g_{i}({nT})}}{C}}}}$ $\begin{matrix} {{u\left( {{nT} + T} \right)} = {{{- \frac{auxv}{\Delta}}{\sum\limits_{i}\frac{h_{21}^{i}{g_{i}({nT})}}{C}}} + {auxu}}} \\ {= {{{- {v\left( {{nT} + T} \right)}}{\sum\limits_{i}\frac{h_{21}^{i}{g_{i}({nT})}}{C}}} + {auxu}}} \end{matrix}$

Note that for the NMDA case with a double exponential, each exponential may most likely be dealt with individually. This leads to pre-calculating and storing two vectors, one for the decaying exponential term and one for the rising exponential term.

FIG. 21 is a block diagram 2100 illustrating the realization of Eq. (106). For simplicity, the matrix inversion block 2102 representing the first portion of Eq. (106) is not expanded. From the current state vector x(nT), the membrane potential v(nT) from the state vector is quantized in the quantization block 2104 to determine the memory index. The memory index is used to select the predetermined parameters (e.g., coefficients) for the piecewise linear approximation of the neuron model corresponding to the quantization interval of the membrane potential and stored in the memory lookup table(s) 2106. Based on the memory index, the parameters associated with the quantization interval are loaded, including the coefficients for the exponential matrix G 2108 and the defined vector q 2110 from Eq. (99) above. The parameters also include the coefficients for input current vector h 2112 and N synaptic current input vectors h_(i) 2114. Summation block 2116 sums the input current I(nT)/C applied to the vector h 2112 and conductance values scaled by the reverse potentials E_(i)g_(i)(nT)/C applied to the N synaptic current input vectors h_(i) 2114. The result is processed according to Eq. (106) with the matrix inversion block 2102 to generate the updated state vector x(nT+T). A delay block 2118 may be added so that the states are updated at each step size T in time, rather than continuously.

Other approximations to the integrals in Eq. (101) could be used. For example, rather than calculating the exact values and storing them in the h_(i) vectors, a trapezoidal rule applied to g(t) can be used, thus avoiding storage of the h_(i) vectors and further reducing the memory demands at the expense of a slightly worse approximation.

SUMMARY

In the subsections above, a general approach to piecewise linearization of neuron models was described. FIG. 7 summarizes the various steps and linearization methods. Starting with a nonlinear time varying system at 702, piecewise linearization may be performed over the interval T_(n)≦t≦T_(n+1) at 704 to generate a piecewise linear time-varying system in terms of the matrix A(v_(n), t) at 706. If constant coefficients (i.e., a piecewise constant function) are used for each interval T_(n)≦t≦T_(n+1) at 708, then a piecewise LTI system is formed at 710 in terms of the matrix A(v_(n),T_(n)). If this linearization is performed independent of the time interval at 712, then a piecewise LTI system is created at 714 in terms of the matrix A(v_(n)).

Example State-Space Region-Dependent Linear Neuron Modeling

Certain aspects of the present disclosure described above mainly cover the partitioning of a two-dimensional state-space limited to one of the state variables (e.g., the membrane potential v). As described above, the (v,u) state-space is partitioned into vertical blocks using a single state, and each block, representing a voltage interval, is associated with a distinct set of linear differential equations.

Certain aspects of the present disclosure as described below extend this concept. The state space may be partitioned into different regions (not limited to vertical blocks), where each region is associated with a distinct set of linear differential equations. The regions may be non-overlapping. The description below is primarily focused on the two-state (or, equivalently, two-dimensional) model with the understanding that the two-state model may be readily extended to three or more states where the partitions may be volumes and multi-dimensional regions, respectively.

Review of the Piecewise Linear Formulation as a Function of v

The two-dimensional piecewise linear differential equations may be expressed as a set of K pairs of differential equations where the n^(th) pair is defined by

$\begin{matrix} {{{C\frac{}{t}v} = {{m_{k}v} + d_{k} - u + I}},{v_{k} \leq v < v_{k + 1}}} & (109) \\ {{\frac{}{t}u} = {{abv} - {a\; u} - {abv}_{r}}} & (110) \end{matrix}$

where kε[1,K] and F(v)=m_(k)v+d_(k). In this approach, the voltage space is partitioned into K distinct regions, and the k^(th) region is associated with the k^(th) pair of differential equations. The union of the K regions covers the space of (v,u) values. FIG. 8 illustrates the partitioning given K=4, where the voltage space is divided into four regions: v<v₁, v₁≦v<v₂, v₂≦v<v₃, and v₃≦v. For K=2, this reduces to the Hunzinger Cold neuron model (with the closed and open intervals switched such that v_(k)<v≦v_(k+1)).

Generalized Formulation

The basic idea is to extend the piecewise linear concept beyond regions defined solely in terms of v (i.e., allow Eq. (110) to vary with each interval, as well as Eq. (109)). This can be accomplished by defining K two-dimensional regions Ω_(k) in the (v,u) space where kε[1,K] and where the union of the K regions covers the entire space of (v,u) values. Furthermore, the parameters a and b, in addition to m_(k) and d_(k), are allowed to be distinct for each region such that these parameters become a function of k. The parameter C may also be made distinct per region as C_(k), but is left as fixed per region henceforth, with the understanding that C can be made region-specific. These extensions may not necessarily have biological equivalents. However, from an engineering and computational perspective, such extensions enable the design of richer neuron models and a simpler platform to develop neuron models.

The two aforementioned extensions yield:

$\begin{matrix} {{{C\frac{}{t}v} = {{m_{k}v} + d_{k} - u + I}},{\left( {v,u} \right) \in \Omega_{k}}} & (111) \\ {{{\frac{}{t}u} = {{a_{k}b_{k}v} - {a_{k}u} - {a_{k}b_{k}v_{r}}}},{\left( {v,u} \right) \in \Omega_{k}}} & (112) \end{matrix}$

The above expressions may be expressed more compactly, using the state-space notation described above, as

$\begin{matrix} {{{\overset{.}{x} = {{A_{k}x} + {b\left( \frac{I}{C} \right)} + p_{k}}},{x \in \Omega_{k}}}{where}} & (113) \\ {x \equiv \begin{bmatrix} v \\ u \end{bmatrix}} & (114) \\ {A_{k} \equiv \begin{bmatrix} \frac{m_{k}}{C} & {- \frac{1}{C}} \\ {a_{k}b_{k}} & {- a_{k}} \end{bmatrix}} & (115) \\ {p_{k} \equiv \begin{bmatrix} {d_{k}/C} \\ {{- a_{k}}b_{k}v_{r}} \end{bmatrix}} & (116) \\ {b \equiv \begin{bmatrix} 1 \\ 0 \end{bmatrix}} & (117) \end{matrix}$

Next, the M-dimensional state-space region-dependent case and the state-space solution are described.

M-Dimensional State-Space Case

In the M-dimensional case where there are M state variables, the state-space equations become

$\begin{matrix} {{{\overset{.}{x} = {{A_{k}x} + {b\left( \frac{I}{C} \right)} + p_{k}}},{x \in \Omega_{k}}}{where}} & (118) \\ {x \equiv \begin{bmatrix} x_{1} \\ \vdots \\ x_{M} \end{bmatrix}} & (119) \\ {A_{k} \equiv \begin{bmatrix} a_{11}^{(k)} & \ldots & a_{1M}^{(k)} \\ \vdots & \ddots & \vdots \\ a_{M\; 1}^{(k)} & \ldots & a_{MM}^{(k)} \end{bmatrix}} & (120) \\ {p_{k} \equiv \begin{bmatrix} d_{1}^{(k)} \\ \vdots \\ d_{M}^{(k)} \end{bmatrix}} & (121) \\ {b \equiv \begin{bmatrix} 1 \\ 0 \\ \vdots \\ 0 \end{bmatrix}} & (122) \end{matrix}$

Region-Dependent State-Space Solutions

The state-space solutions of Eq. (113) in the continuous-time domain and discrete-time domain are presented. Their derivations follow naturally using the same approach as that described above. The continuous-time solution may be expressed as

$\begin{matrix} {{{x(t)} = {{e^{A_{k}t}{x(0)}} + {\int_{0}^{t}{{e^{A_{k}{({t - \tau})}} \cdot b \cdot {{I(\tau)}/C}}{\tau}}} + q_{k}}},{{x(0)} \in \Omega_{k}}} & (123) \end{matrix}$

where x(0) represents the initial value of x(t),

q _(k) ≡A _(k) ⁻¹(e ^(A) ^(k) ^(t) −I)·p _(k)  (124)

and e^(x) represents the matrix exponential of a matrix X.

The corresponding discrete-time solution, with a sampling period of T, may be expressed as:

x(nT+T)=e ^(A) ^(k) ^(t) ·x(nT)+h _(k) ·I(nT)/C+q _(k) , x(nT)εΩ_(k)  (125)

where

$\begin{matrix} \begin{matrix} {h_{k} \equiv {\int_{0}^{T}{e^{A_{k}\tau}{\tau}\; b}}} \\ {= {{A_{k}^{- 1}\left( {e^{A_{k}t} - I} \right)}\left( {126b} \right)}} \end{matrix} & \left( {126a} \right) \end{matrix}$

The present state-space vector x(nT) identifies the region Ω_(k) and which set of {e^(A) ^(k) ^(t), h_(k), q_(k)} matrix and vectors to use to compute x(nT+T) according to Eq. (120).

Furthermore, the same solutions for non-synaptic and synaptic current types described above readily apply. This includes the linear-time varying (LTV) solutions. This would involve replacing the voltage-dependent regions (vertical partitions) with these more general state-space regions.

Illustrative Examples

FIG. 9 illustrates an example with three regions (i.e., Ω_(k) where kε[1,3]). All three regions in FIG. 9 are rectangular regions.

FIG. 10 illustrates an example with four regions illustrating how the regions need not be rectangular. This particular design may be used to create a subthreshold oscillation neuron where Ω₁, Ω₂, Ω₃, and Ω₄ represent regions where (v,u), respectively, spirals outward with a growing radius, spirals in a circular fashion (with no decay or no growth), spirals inward with a decaying radius, and tends to spike (equivalent to the ALIF region of the Hunzinger Cold model). This design is described in more detail below.

FIG. 11 illustrates a more academic example with five regions to illustrate that a region with any shape (e.g., a hexagonal, triangular, or star-shaped region) could be created in theory.

Realization of the State-Space Region-Dependent Linear Neuron Modeling

Presently, the regions are defined by

Ω_(k)={(V,u)|v _(k) ≦v<v _(k+1)}

where v_(k) and v_(k+1) represent the left and right boundaries for voltage. So, at each time step, the index k is determined by taking the present state (v(nT),u(nT)) and checking it against each of the K regions: Ω_(k) kε[1,K]. The index k, represented by k_(F), may be computed directly via a function of only v as well as the quantization interval, the minimum possible voltage, and number of intervals:

$k = {\left\lfloor \frac{{v({nT})} - v_{\min,F}}{\Delta \; v_{F}} \right\rfloor + 1}$

For certain aspects, the regions (or at least a portion thereof) may be slightly overlapping. In this case, hysteresis may be used in identifying which of the K regions (Ω_(k), kε[1, K]) contains the present state (v(nT),u(nT)).

Two examples of generalized regions are provided below. Other regions may also be developed.

For Rectangular Regions Dependent on Both v and u

For generalized rectangular regions, the k^(th) region may be defined by

Ω_(k)={(V,u)|v _(k) ≦v<v _(k+1) , u _(k) ≦u<u _(k+1)}

where v_(k) and v_(k+1) represent the left and right boundaries for voltage, respectively, and where u_(k) and u_(k+1) represent the lower and upper boundaries for the recovery variable, respectively. So, at each time-step, the index k may be determined by identifying which of the K regions (Ω_(k), kε[1,K]) contains the present state (v(nT),u(nT)).

For Elliptical Regions

For ease of explanation, assume only elliptical regions each centered about the rest state (v_(r),0). Then the k^(th) region may be defined by

Q _(k)={(v,u)|ρ_(k)≦ρ(v,u)<ρ_(k+1)}

where ρ_(k) is the “radial distance” to the inner elliptical boundary along the v-axis, ρ_(k) is the “radial distance” to the outer elliptical boundary along the v-axis, the “radial distance” may be defined as

ρ(v,u)≡√{square root over ((v−v _(r))²+(u/β)²)}{square root over ((v−v _(r))²+(u/β)²)}

and β is a parameter associated with the ellipse (β=1 leads to concentric regions). As before, at each time-step, the index k is determined by taking the present state (v(nT), u(nT)) and checking it against each of the K regions: Ω_(k), kε[1,K].

Advantages of State-Space Region-Dependent Linear Neuron Modeling

Such generalized partitioning of the state-space for neuron modeling can help support the synthesis of neurons and do so in a systematic manner. Two examples of this are in implementing: (1) onset detection and event counting and (2) subthreshold oscillation behavior, the latter of which is described in the next section.

An artificial neuron based on the Hunzinger Cold model (which has two partitions) may be developed for onset detection and event counting. This artificial neuron, initially at rest, is designed to fire immediately if it receives a spike for onset detection. Thereafter, the neuron is designed to start counting incoming spikes and fire after a certain number of spikes. This continues to repeat itself as spikes arrive. A potential drawback of this design occurs after there are no more spike arrivals since the neuron can take about 500 ms before reaching the equilibrium rest state. This may be too long a time before the neuron can perform onset detection. Part of the constraint in this design is how shortening the time to the rest state impacts the spike-counting ability by making it behave more as a LIF neuron.

According to certain aspects of the present disclosure, the constraint can be removed by separating the two behaviors via partitioning, analogous to how the LIF and ALIF behavior of the Izhikevich neuron model may be broken by partitioning the two regions with the Hunzinger Cold model. The time to reset the neuron to perform onset detection may be reduced by noticing how the u state variable behaves above and below a threshold of roughly 0.3 in the LIF region. Below that value, it takes a long time for the system to reach the rest state. This can be expedited by partitioning the state-space in terms of u as well as v as illustrated in the three-region state-space of FIG. 9 to realize an improved onset and event counting neuron. In the LIF region where v<v_(t), the artificial neuron now behaves as an integrate and fire (IF) neuron for event counting if u>u₀ (i.e., region Ω₂) and a LIF neuron which goes to v_(r) otherwise (i.e., region Ω₁). Once the state enters region Ω₁, the system may be designed to move to the rest state as quickly as desired with shorter time constants. By partitioning the LIF region as a function of u into the two desired regions (Ω₂ for IF and Ω₁ for LIF) with two pairs of differential equations per region, the large delay may be eliminated.

Example Subthreshold Oscillation Neuron Design Based on State-Space Region-Dependent Linear Neuron Models

Subthreshold oscillations may be used in an artificial nervous system to increase the likelihood of spiking in the upswing of the membrane potential from the resting potential (i.e., “priming” the artificial neuron to spike) and to decrease the likelihood in the downswing. The previous section describes an extension to the piecewise linear neuron modeling by allowing partitioning of a two-dimensional (or multi-dimensional) state-space based not only on one of the state variables (e.g., the voltage), but also a combination and regions (or functions) of state variables. This section addresses the shortcomings of existing subthreshold oscillation neuron designs. For example, existing neuron models can support the design of a subthreshold oscillation neuron exhibiting at most one of three oscillation types (e.g., decaying oscillations as illustrated in the graph 1200 of FIG. 12A, sustained oscillations as illustrated in the graph 1210 of FIG. 12B, or growing oscillations as illustrated in the graph 1220 of FIG. 12C), but these models cannot enable the design of an artificial neuron exhibiting two or more of the three types. Moreover, existing neuron models cannot support the systematic design of subthreshold oscillation neurons with a particular oscillation frequency, a rate of decay for decaying oscillation, a rate of growth for growing oscillations, and/or a magnitude for sustained oscillations.

Accordingly, what is needed are artificial neurons with an improved neuron model capable of exhibiting all three types of oscillations and supporting the systematic realization of desired oscillation behaviors.

Comparison Between Subthreshold-Oscillation-Capable Neuron Models

There are four existing neuron models that can produce subthreshold oscillations: the Izhikevich (simple) model, the Adaptive Exponential (AdEx) neuron model (which is the linear-plus-exponential function of Brette and Gerstner described above), the quartic model, and the Hunzinger Cold model. These neuron models may characterized in four ways: (1) which of the three possible subthreshold oscillation behaviors (damped oscillation, sustained oscillation, or growing oscillations) they can produce; (2) how many of the three behaviors can be exhibited by a single neuron; (3) how easy it is to design a neuron with a desired oscillation frequency; and (4). how easy it is to fine tune the oscillation design (e.g., defining the magnitude of the sustained oscillation or defining multiple rates of decays or growths). The following table summarizes how each neuron model fares for the first measure (where these neuron models can possibly support from one to all of the three oscillation types):

Damped Sustained Growing Neuron Model Oscillations Oscillations Oscillations Izhikevich model Y and AdEx model Quartic model Y Y Y Hunzinger Y Y Y Cold model State-space Y Y Y region- dependent model

The next table summarizes how each neuron model fares for the remaining characterization measures:

System- Fine One Two Three atic, tuning type of types of types of simple capa- Model oscillation oscillation oscillation design bility Izhikevich and Y AdEx models Quartic model Y Hunzinger Y Y Cold model State-space Y Y Y Y Y region- dependent model

Each neuron model (besides the state-space region-dependent approach described below) can reproduce a neuron capable of exhibiting only a single oscillation type. And only the Hunzinger Cold model, due to its linear design, is capable of offering a systematic way of designing a target. None of them (besides the state-space region-dependent approach described below), however, offers the capability of fine tuning

Subthreshold Oscillation Based on State-Space Region-Dependent Linear Neuron Modeling

Certain aspects of the present disclosure, as indicated in the tables above and in contrast with existing neuron models, can: (1) produce an artificial neuron that can exhibit in the subthreshold regime all or any subset of the three oscillation types and (2) be designed not only systematically like the Hunzinger Cold model, but can also support fine tuning of the design.

Design

Exhibition of all three oscillation types may be created by using the state-space region dependent approach described above. For example, a four-region, two-dimensional neuron model may be defined as illustrated in FIG. 10.

Each state-space region Ω_(k) is associated with a set of linear differential equations such that

$\begin{matrix} {{{C\frac{}{t}v} = {{m_{k}v} + d_{k} - u + I}},{\left( {v,u} \right) \in \Omega_{k}}} & (127) \\ {{{\frac{}{t}u} = {{a_{k}b_{k}v} - {a_{k}u} - {a_{k}b_{k}v_{r}}}},{\left( {v,u} \right) \in \Omega_{k}}} & (128) \end{matrix}$

or, in state-space vector notation,

$\begin{matrix} {{{\overset{.}{x} = {{A_{k}x} + {b\left( \frac{I}{C} \right)} + p_{k}}},{x \in \Omega_{k}}}{and}} & (129) \\ {A_{k} \equiv \begin{bmatrix} \frac{m_{k}}{C} & {- \frac{1}{C}} \\ {a_{k}b_{k}} & {- a_{k}} \end{bmatrix}} & (130) \\ {p_{k} \equiv \begin{bmatrix} {d_{k}/C} \\ {{- a_{k}}b_{k}v_{r}} \end{bmatrix}} & (131) \end{matrix}$

Regions Ω₁ (appearing circular, but is generally elliptical), Ω₂ (also generally elliptical), Ω₃, and Ω₄ may be designed to reproduce growing oscillations, sustained oscillations, decaying oscillations, and ALIF behavior, respectively.

According to certain aspects, the state-space may be defined by more than two dimensions. In this case, the following alternate forms may be used instead:

$\begin{matrix} {A_{k} \equiv \begin{bmatrix} a_{11}^{(k)} & \ldots & a_{1M}^{(k)} \\ \vdots & \ddots & \vdots \\ a_{M\; 1}^{(k)} & \ldots & a_{MM}^{(k)} \end{bmatrix}} & (132) \\ {p_{k} \equiv \begin{bmatrix} d_{1}^{(k)} \\ \vdots \\ d_{M}^{(k)} \end{bmatrix}} & (133) \end{matrix}$

If sustained oscillations are desired, some thickness may be warranted in case of time-stepped approaches to handle the scenario where v(nT+T) could inadvertently bypass the sustained oscillation region.

Reset Modification

As described above, the reset mechanism may involve resetting u to u+d, which amounts to incrementing u after a spike event or after a control signal is activated, for example. For certain aspects, to ensure that the u+d value is not so large that it can cause the neuron to immediately spike or enter sustained oscillation right from the start, it may be desirable to have the option of resetting u to a target constant (i.e., to something other than u+d). This way, the designer has control of where in the state-space the neuron resets.

Defining the State-Space Regions

In general, the (v,u) trace in sustained oscillations may take on the form of an ellipse whose major and minor axes may not be aligned with the v, u Cartesian axes (i.e., the ellipse may have a tilt). The solutions may take on the following form:

v(t)=)A _(c) ^((v))cos(wt)+A _(s) ^((v))sin(wt)  (134a)

u(t)=A _(c) ^((u))cos(wt)+A _(s) ^((u))sin(wt)  (134b)

where the four coefficients are functions of the matrix elements in A (where the index k has been dropped) and the initial conditions: (v(0),u(0)).

For ease in exposition and design, the description here focuses on circular traces whose major and minor axes are equal. These call for the matrix elements to satisfy the following constraints:

$\begin{matrix} {a_{11} = {a_{22} = {\lambda_{R} = \frac{1}{\tau}}}} & (135) \\ {a_{12} = {{- a_{21}} = {\lambda_{I} = {2\pi \; f_{c}}}}} & (136) \end{matrix}$

where λ_(R) and λ_(I) represent the real and imaginary parts, respectively, of the complex eigenvalues: λ_(1,2)=λ_(R)±λ_(I), τ represents the (decay or rise) time constant, f_(c) represents the oscillation frequency, and the index k has been dropped. This results in circular regions and a straightforward form of the matrix:

$\begin{matrix} {A \equiv \begin{bmatrix} \frac{1}{\tau} & {2\pi \; f_{c}} \\ {{- 2}\pi \; f_{c}} & \frac{1}{\tau} \end{bmatrix}} & (137) \end{matrix}$

Using this simpler form with circular regions, the radius of the circle centered about the equilibrium point (v_(r),0) is

ρ(v,u)≡√{square root over ((v−v _(r))² +u ²)}  (138)

representing the distance from (v,u) to the equilibrium point. For example, ρ(v_(r)+2mV,0)=2. So, the k^(th) region may be defined by

Ω_(k)={(v,u)|ρ_(k,in)<ρ(v,u)≦ρ_(k,out) and v≦v _(t)}  (139)

where ρ_(k,in) represents the radius of the inner circular boundary of Ω_(k) and ρ_(k,out) represents the outer circular boundary of Ω_(k).

For the K=4 example in FIG. 10, the sustained oscillation region Ω₂ would be defined by

Ω₂={(v,u)∥ρ_(g)<ρ(v,u)≦ρ_(d) and v≦v _(t)}  (140)

where ρ_(g) represents the radius of the circular boundary separating Ω₁ and Ω₂ and where ρ_(d) represents that between Ω₂ and Ω₃.

For the growing oscillation region Ω₁:

Ω₁={(v,u)|ρ(v,u)≦ρ_(g) and v≦v _(t)}  (141)

For the decaying oscillation region Ω₃

Ω₃={(v,u)|ρ_(d)<ρ(v,u) and v≦v _(t)}  (142)

The ALIF region Ω₄ in FIG. 10 is defined by

Ω₄={(v,u)|v>v _(t)}  (143)

Additional Regions for Multi-Stage Decay and Growth Regions

The above idea may be extended to support more gradual decaying or gradual growing of the oscillations. For example, to have varying rates of decaying orbits and varying rates of growing orbits, multiple rings may be used as shown in FIG. 13 with six regions. In this example, Ω₃ may be considered as the sustained oscillation region. The region Ω₅ may have a faster decaying orbit, and Ω₄ may have a slower decaying orbit. This would allow for a graded and more gentle decay to the sustained oscillation region Ω₃. Similarly, Ω₁ may have a faster growing orbit, and Ω₂ may have a slower growing orbit. This concept may be extended to more rings for even more gradual changes. Furthermore, multi-stage sustained oscillation regions may be used if different sustained oscillation parameters (e.g., different frequencies) are desired.

Example Operations for Implementing an Artificial Neuron

FIG. 14 is a flow diagram of example operations 1400 for updating a state of an artificial neuron in an artificial nervous system, in accordance with certain aspects of the present disclosure. The operations 1400 may be performed in hardware (e.g., by one or more neural processing units (e.g., artificial neurons), such as a neuromorphic processor), in software, or in firmware. The artificial nervous system may be modeled on any of various biological or imaginary nervous systems, such as a visual nervous system, an auditory nervous system, the hippocampus, etc.

The operations 1400 may begin, at 1402, by determining that a first state of the artificial neuron is within a first region. At 1404, a second state of the artificial neuron is determined based at least in part on a first set of linear dynamical equations, wherein the first set of linear dynamical equations is based, at least in part, on a first set of parameters (e.g., coefficients) corresponding to the first region. At 1406, it is determined that the second state of the artificial neuron is within a second region. At 1408, a third state of the artificial neuron is determined based, at least in part, on a second set of linear dynamical equations. The second set of linear dynamical equations may be based, at least in part, on a second set of parameters corresponding to the second region.

According to certain aspects, the first and second sets of linear equations include discrete time solutions of linear time-invariant (LTI) state-space equations. For other aspects, the discrete time solutions may be based at least in part on closed-form solutions for continuous-time state-space equations.

According to certain aspects, the operations 1400 further include fetching at least one of the first or second set of parameters from memory. As used herein, memory may refer to any of various suitable means for storing data, whether permanently or temporarily, locally or remotely to a processing unit, on-chip or off-chip, including random access memory (RAM), cache memory, registers, latches, flip-flops, and the like. Such fetching may include fetching the at least one of the first or second set of parameters from a memory local to the artificial neuron. For certain aspects, the operations 1400 further include calculating at least a portion of at least one of the first or second set of parameters. At least the portion of the at least one of the first or second set of parameters may be calculated using one or more values fetched from memory.

According to certain aspects, at least one of the first or second set of parameters may be obtained by approximating, with a piecewise linear function, at least a portion of a nonlinear function in a neuron model associated with the artificial neuron. For certain aspects, the nonlinear function includes a membrane potential (v) multiplied with a voltage-dependent conductance (g(v)). The voltage-dependent conductance may be approximated with a piecewise constant function. For other aspects, the nonlinear function includes a voltage-dependent function (F(v)), where v is a membrane potential of the artificial neuron. The piecewise linear function may have a slope (m) and an intercept (d) for each of the first and second regions. For certain aspects, the first region has a different width in the piecewise linear function than the second region. A width of the first or the second region in the piecewise linear function may be dependent on the nonlinear function. For certain aspects, the piecewise linear approximation is based at least in part on at least one of a Taylor expansion method, a first order linear interpolation method, an optimal linear interpolation method, or an average slope method.

According to certain aspects, at least one of the first or second set of parameters may be designed at least in part to achieve a particular behavior in the artificial neuron. For example, the first and/or second set of parameters may be generated (e.g., manually selected by a neuron model designer) to effectively create a particular function (e.g., a tunable curve), which approximates the desired behavior. In this manner, the artificial neuron may operate based on an entirely new neuron model or a modification to an existing neuron model.

The first, second, and third states of the artificial neuron may be defined by a membrane potential (v) and a recovery current (u). These are two examples of artificial neuron state variables. According to certain aspects, the operations 1400 may further include resetting at least one of the membrane potential or the recovery current of the artificial neuron based at least in part on a determination that a spike event has occurred or will occur. The membrane potential may be reset to a resting potential (v(t)→v_(r). The recovery current may be reset to a sum of a present value of the recovery current and an offset (u(t)→u(t)+d).

According to certain aspects, at least one of the first set or second set of linear equations is based at least in part on a neuron model for the artificial neuron. For certain aspects, the neuron model is based at least in part on at least one of an Izhikevich simple model, an exponential-integrate-and-fire (EIF) model, a FitzHugh-Nagumo model, a quartic model, or an intrinsic conductance model (e.g., a neuron model expressed as a membrane potential v multiplied with a voltage-dependent conductance g(v)). For certain aspects, the neuron model comprises at least two dimensions (i.e., at least two state variables). The neuron model may be based at least in part on one or more first-order ordinary differential equations (ODEs), which may be linear.

According to certain aspects, a step size in time of the neuron model is based at least in part on a type of the artificial neuron being modeled. A step size in time of the neuron model may be non-uniform. For certain aspects, the step size in time of a particular time step is determined based at least in part on at least one of a current or past state of the artificial neuron or on a particular set of parameters (which may be associated with the current or past state). For certain aspects, a first step size in time between determining the first and second states is different than a second step size in time between determining the second and third states. According to certain aspects, determination of the second state of the artificial neuron at 1404 may be performed for a first time step, and determination of the third state of the artificial neuron at 1408 may be performed for a second time step subsequent to the first time step.

According to certain aspects, determining at least one of the second or third state of the artificial neuron is based at least in part on currents input to the artificial neuron. For certain aspects, the input currents comprise at least one of a synaptic current or a general, external current. The synaptic current may be based at least in part on a time-dependent conductance for each of one or more channels and a reversal potential for each of the one or more channels. For certain aspects, the synaptic current is based at least in part on a post-synaptic membrane potential of the artificial neuron for an N-methyl-D-aspartate (NMDA) channel. The time-dependent conductance may be modeled by an exponential function, an alpha function, or a difference-of-exponentials function.

For certain aspects, the first and second regions are the same region.

According to certain aspects, the operations 1400 may further include outputting an indication of at least one of the first state, the second state, or the third state to a display.

According to certain aspects, at least one of the first region or the second region is defined by two or more dimensions. The at least one of the first region or the second region is an M-dimensional subspace, where M≧2. The M-dimensional subspace may have any shape or be defined by any boundary (e.g., v>10 mV). For certain aspects, the two or more dimensions are two dimensions, and the M-dimensional subspace has a two-dimensional shape, such as an ellipse, a circle, a polygon, a rectangle, or a square. For other aspects, the two or more dimensions are three dimensions, and the M-dimensional subspace has a three-dimensional shape, such as a sphere, an ellipsoid, a polygonal prism, a rectangular prism, or a cube. For certain aspects, the first region is associated with a different set of linear equations than the second region. The first and second regions may be partially overlapping or non-overlapping regions. The first and second regions may have at least one of different shapes or different sizes. For certain aspects, the first region is associated with a first behavior of the artificial neuron, and the second region is associated with a second behavior of the artificial neuron, different from the first behavior. For certain aspects, the first and second regions have layered shapes, such as concentric rings, tubes, rectangular frames, and the like.

According to certain aspects, the two or more dimensions are composed of two dimensions defined by a membrane potential (v) and a recovery current (u). For certain aspects, the operations 1400 may further include resetting at least one of the membrane potential or the recovery current of the artificial neuron based at least in part on at least one of receipt of a control signal or a determination that a spike event has occurred or will occur. In this case, the membrane potential may be reset to a resting potential, and the recovery current may be reset to a constant.

According to certain aspects, at least a portion of the second region overlaps the first region. In this case, determining that the second state of the artificial neuron is within the second region at 1406 may be based at least in part on hysteresis.

According to certain aspects, the artificial neuron is configured for onset detection and event counting. In this case, the first region may be associated with an integrate-and-fire (IF) behavior for the event counting, and the second region may be associated with a leaky integrate-and-fire (LIF) behavior.

According to certain aspects, the artificial neuron is configured for subthreshold oscillation behavior. The subthreshold oscillation behavior may include at least one of a damped oscillation behavior, a sustained oscillation behavior, or a growing oscillation behavior. For certain aspects, the first region may be associated with the growing oscillation behavior, the second region may be associated with the sustained oscillation behavior, and a third region may be associated with the decaying oscillation behavior. Furthermore, a fourth region is associated with an ALIF behavior. For certain aspects, the first region may have an elliptical shape, whereas the second region may have a ring shape.

Example Common and Flexible Neural Architecture

Certain aspects of the present disclosure generally relate to developing a common and flexible architecture supporting dynamical neuron models. The design goals include low complexity, accurate modeling of the neuron dynamics, and the ability to implement any neuron model. With this flexible architecture, any of various suitable neuron models may be executed and substituted as desired. For example, the neuron model may include at least one of an Izhikevich simple model, an exponential-integrate-and-fire (EIF) model, a FitzHugh-Nagumo model, a quartic model, or a Hunzinger Cold model. Such neuron models may be implemented using the piecewise linear approximations and parameters (e.g., coefficients) associated therewith, as described above. Furthermore, this flexible architecture allows different artificial neurons in an artificial nervous system to operate with different neuron models simultaneously.

FIG. 15A illustrates implementation of such a common and flexible neural architecture for a single neural processing unit 1502, where parameters for neuron models can be selected, loaded, accessed, added, deleted, adjusted, and/or updated, in accordance with certain aspects of the present disclosure. The concepts described herein may easily be expanded to a system of neural processing units 1502 (e.g., an artificial nervous system), but for ease of description, only a single neural processing unit is shown in FIG. 15A. The neural processing unit 1502 may implement a state machine 1506 that receives one or more inputs and a set of parameters for a neuron model and outputs one or more state variables as shown. The state machine 1506 may implement any suitable processing algorithm for an artificial neuron.

The parameters for a given neuron model may be selected from a set of parameters 1504 for a plurality of neuron models. For certain aspects, for example, an operator may wish to use a certain neuron model in a given neural processing unit and select this model from a list of available neuron models. For other aspects, a certain neuron model may be selected by the system of neural processing units based on learning or training operations. The parameters for a given neuron model may be parameters based on the piecewise linear approximations described above. The set of parameters 1504 may be stored in a memory associated with and/or local to the neural processing unit 1502 for certain aspects. For other aspects, the set of parameters 1504 may be stored in a memory globally accessible by multiple neural processing units or a cache memory internal to the neural processing unit 1502. The parameters for neuron model A may be stored in a first memory location 1508 (e.g., an addressable memory block), while the parameters for neuron model B may be stored in a second memory location 1510.

In FIG. 15A, the parameters for neuron model A have been loaded into the neural processing unit 1502. As used herein, the term “loading” may be defined broadly and may include fetching the parameters for a given neuron model from a memory accessible by the neural processing unit (or by the system of neural processing units); storing the parameters in a memory local to the neural processing unit; or accessing, in a memory, one or more memory areas associated with (e.g., designated for) the neural processing unit. According to certain aspects, loading the parameters for a certain neuron model into a particular neural processing unit may occur in response to a configuration event. For example, the configuration event may include powering up the particular neural processing unit, powering up one or more regions of neural processing units (which may or may not include the particular processing unit), or powering up the entire system of neural processing units.

In FIG. 15B, the parameters for neuron model B have been loaded into the neural processing unit 1502. From then on, the state machine 1506 may operate based at least in part on these most recently loaded parameters. In this manner, the neural processing unit 1502 may function according to a different neuron model, simply by loading different parameters. Furthermore, the parameters for a particular neuron model may be updated or deleted at any time.

In FIG. 15C, parameters for neuron model C may be added to the set of parameters 1504. For example, neuron model C may be a recently developed, purchased, or licensed neuron model that was not available when the neural processing unit 1502 became operational. In other example scenarios, the architect or system designer may have not considered neuron model C or may have originally thought this model did not fit the desired application, but now desires to add this model.

In FIG. 15D, the parameters for neuron model C may be stored in a third memory location 1512. The parameters for neuron model C may be loaded into the neural processing unit 1502, such that the state machine 1506 may operate based at least in part on these most recently loaded parameters. The ability to effectively change neuron models for a neural processing unit by simply loading different parameters therein provides a very flexible architecture that can be updated and changed as desired.

FIG. 16 is a flow diagram of example operations 1600 for implementing a combination of a plurality of neuron models in a system of neural processing units (e.g., an artificial nervous system), in accordance with certain aspects of the present disclosure. The operations 1600 may be performed in hardware (e.g., by one or more processing units, such as a neuromorphic processor), in software, or in firmware. The artificial nervous system may be modeled on any of various biological or imaginary nervous systems, such as a visual nervous system, an auditory nervous system, the hippocampus, etc.

The plurality of neuron models may include any combination of the neuron models described above, as well as any suitable neuron models in existence or as yet undeveloped or undisclosed. For example, the plurality of neuron models may include at least one of an Izhikevich simple model, an exponential-integrate-and-fire (EIF) model, a FitzHugh-Nagumo model, a quartic model, a Hunzinger Cold model, or an intrinsic conductance model. As used herein, the phrase “combination of the neuron models” generally refers to a set of the plurality of neuron models, where the set may include a single member. In other words, the combination of the plurality of neuron models includes one of the plurality and any combination of any subset of the plurality.

The operations 1600 may begin, at 1602, by loading parameters for a first neuron model selected from the plurality of neuron models into a first neural processing unit (e.g., an artificial neuron). The parameters for a given neuron model may be parameters derived from the piecewise linear approximations of the neuron models as described above. At 1604, a first state of the first neural processing unit may be determined based, at least in part, on the loaded parameters for the first neuron model. At 1606, a second state of the first neural processing unit may be determined based, at least in part, on the parameters for the first neuron model and on the first state.

According to certain aspects, the plurality of neuron models may be updated, at 1608. As described above, updating the plurality of neuron models may include deleting or adjusting certain parameters for the existing neuron models or adding parameters for another neuron model (e.g., a new neuron model that was not available at the time the plurality of neuron models were made available to the system or a desired modification to an existing neuron model to effectively create a new neuron model). For certain aspects, updating the plurality of neuron models may occur before loading (or re-loading) the parameters for the first neuron model and determining the next state of the first neural processing unit.

At 1610, parameters for a second neuron model may optionally be loaded into the first neural processing unit. These parameters for the second neuron model may replace the parameters loaded at 1602 for the first neuron model. The plurality of neuron models need not be updated at 1608 before the parameters for the second neuron model are loaded at 1610. At 1612, a third state of the first neural processing unit (e.g., subsequent to the second state) may be determined based, at least in part, on the parameters for the second neuron model.

According to certain aspects, loading the parameters for the first model at 1602 (or for the second neuron model at 1610) is in response to a configuration event. For certain aspects, the configuration event is a power up for at least one of the system of neural processing units or the first neural processing unit.

According to certain aspects, determining the third state at 1612 is further based, at least in part, on the second state. If a determination of a subsequent state based on parameters for a subsequent neuron model is based on a previous state determined under parameters for a previous neuron model (different from the subsequent neuron model), this may be referred to as a “hot swap.” For certain aspects, the second neuron model is configured, at least in part, to generate a subthreshold oscillation under this “hot swap” condition. This oscillation may start from the second state or at another time. For certain aspects, the loading of the parameters for the second neuron model at 1610 is based, at least in part, on at least one of a state condition (e.g., the state entering a particular region or exhibiting a certain behavior, such as a rate of change, etc.), a time condition (e.g., based on a timer), or a trigger. The trigger may be external to the first neural processing unit, for example.

According to certain aspects, the operations 1600 may further include loading parameters for a second neuron model selected from the plurality of neuron models into a second neural processing unit. Then, a state of the second neural processing unit may be determined based, at least in part, on the parameters for the second neuron model. For certain aspects, the first and second neural processing units are located in different areas of the system. For certain aspects, the first and second neuron models represent different types of neurons. In other words, the different neuron models in the system of neural processing units may be used to emulate neurons that are in different regions of a neural system. For example, neurons in the visual, auditory, or motor control system may be represented by different neuron models.

Loading the parameters for the first, the second, or any other neuron model may involve any of various suitable operations. The description below includes loading the parameters for the first neuron model for ease of description, but such loading applies to the parameters for any other neuron model, as well. According to certain aspects, loading the parameters for the first neuron model includes loading the parameters for the first neuron model into a plurality of neural processing units including the first neural processing unit. For certain aspects, loading the parameters for the first neuron model includes fetching at least a portion of the parameters for the first neuron model from a memory. This memory may be accessible by the system of neural processing units for certain aspects. For certain aspects, at least a portion of the memory may be local to the first neural processing unit. At least portion of the memory may be cache memory. For certain aspects, loading the parameters for the first neuron model further includes accessing, in the memory, a memory block associated with the first neuron model. In this case, the memory block may be designated by a pointer to a memory address in the memory block.

FIG. 17 illustrates an example block diagram 1700 of components for implementing the aforementioned methods for operating an artificial neuron using a general-purpose processor 1702 in accordance with certain aspects of the present disclosure. Variables (neural signals), synaptic weights, and/or system parameters associated with a computational network (neural network) may be stored in a memory block 1704, while instructions related executed at the general-purpose processor 1702 may be loaded from a program memory 1706. In an aspect of the present disclosure, the instructions loaded into the general-purpose processor 1702 may comprise code for determining that a first state of an artificial neuron is within a first region; code for determining a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; code for determining that the second state of the artificial neuron is within a second region; and code for determining a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region. For certain aspects, at least one of the first or second region is defined by two or more dimensions.

In another aspect of the present disclosure, the instructions loaded into the general-purpose processor 1702 may comprise code for loading parameters for a first neuron model selected from a plurality of neuron models into a first neural processing unit (in a system of neural processing units) and code for determining a first state of the first neural processing unit based at least in part on the parameters for the first neuron model.

FIG. 18 illustrates an example block diagram 1800 of components for implementing the aforementioned method for operating an artificial neuron where a memory 1802 can be interfaced via an interconnection network 1804 with individual (distributed) processing units (neural processors) 1806 of a computational network (neural network) in accordance with certain aspects of the present disclosure. Variables (neural signals), synaptic weights, and/or system parameters associated with the computational network (neural network) may be stored in the memory 1802, and may be loaded from the memory 1802 via connection(s) of the interconnection network 1804 into each processing unit (neural processor) 1806. In an aspect of the present disclosure, the processing unit 1806 may be configured to determine that a first state of an artificial neuron is within a first region; to determine a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; to determine that the second state of the artificial neuron is within a second region; and to determine a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region. For certain aspects, at least one of the first or second region is defined by two or more dimensions.

In another aspect of the present disclosure, the processing unit 1806 may be configured to load parameters for a first neuron model selected from a plurality of neuron models into a first neural processing unit (in a system of neural processing units) and to determine a first state of the first neural processing unit based at least in part on the parameters for the first neuron model.

FIG. 19 illustrates an example block diagram 1900 of components for implementing the aforementioned method for operating an artificial neuron based on distributed weight memories 1902 and distributed processing units (neural processors) 1904 in accordance with certain aspects of the present disclosure. As illustrated in FIG. 19, one memory bank 1902 may be directly interfaced with one processing unit 1904 of a computational network (neural network), wherein that memory bank 1902 may store variables (neural signals), synaptic weights, and/or system parameters associated with that processing unit (neural processor) 1904. In an aspect of the present disclosure, the processing unit(s) 1904 may be configured to determine that a first state of an artificial neuron is within a first region; determine a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; determine that the second state of the artificial neuron is within a second region; and determine a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region. For certain aspects, at least one of the first or second region is defined by two or more dimensions.

In another aspect of the present disclosure, the processing unit(s) 1904 may be configured to load parameters for a first neuron model selected from a plurality of neuron models into a first neural processing unit (in a system of neural processing units) and to determine a first state of the first neural processing unit based at least in part on the parameters for the first neuron model.

FIG. 20 illustrates an example implementation of a neural network 2000 in accordance with certain aspects of the present disclosure. As illustrated in FIG. 20, the neural network 2000 may comprise a plurality of local processing units 2002 that may perform various operations of methods described above. Each processing unit 2002 may comprise a local state memory 2004 and a local parameter memory 2006 that store parameters of the neural network. In addition, the processing unit 2002 may comprise a memory 2008 with a local (neuron) model program, a memory 2010 with a local learning program, and a local connection memory 2012. Furthermore, as illustrated in FIG. 20, each local processing unit 2002 may be interfaced with a unit 2014 for configuration processing that may provide configuration for local memories of the local processing unit, and with routing connection processing elements 2016 that provide routing between the local processing units 2002.

According to certain aspects of the present disclosure, each local processing unit 2002 may be configured to determine parameters of the neural network based upon desired one or more functional features of the neural network, and develop the one or more functional features towards the desired functional features as the determined parameters are further adapted, tuned and updated.

The various operations of methods described above may be performed by any suitable means capable of performing the corresponding functions. The means may include various hardware and/or software component(s) and/or module(s), including, but not limited to a circuit, an application specific integrated circuit (ASIC), or processor. For example, the various operations may be performed by one or more of the various processors shown in FIGS. 17-20. Generally, where there are operations illustrated in figures, those operations may have corresponding counterpart means-plus-function components with similar numbering. For example, operations 1400 illustrated in FIG. 14 correspond to means 1400A illustrated in FIG. 14A.

For example, means for displaying may comprise a display (e.g., a monitor, flat screen, touch screen, and the like), a printer, or any other suitable means for outputting data for visual depiction (e.g., a table, chart, or graph). Means for processing, means for generating, means for loading, means for resetting, means for fetching, means for updating, means for calculating, means for computing, means for outputting, or means for determining may comprise a processing system, which may include one or more processors or processing units. Means for storing may comprise a memory or any other suitable storage device (e.g., RAM), which may be accessed by the processing system.

As used herein, the term “determining” encompasses a wide variety of actions. For example, “determining” may include calculating, computing, processing, deriving, investigating, looking up (e.g., looking up in a table, a database or another data structure), ascertaining, and the like. Also, “determining” may include receiving (e.g., receiving information), accessing (e.g., accessing data in a memory), and the like. Also, “determining” may include resolving, selecting, choosing, establishing, and the like.

As used herein, a phrase referring to “at least one of” a list of items refers to any combination of those items, including single members. As an example, “at least one of a, b, or c” is intended to cover a, b, c, a-b, a-c, b-c, and a-b-c.

The various illustrative logical blocks, modules, and circuits described in connection with the present disclosure may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array signal (FPGA) or other programmable logic device (PLD), discrete gate or transistor logic, discrete hardware components or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any commercially available processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

The steps of a method or algorithm described in connection with the present disclosure may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in any form of storage medium that is known in the art. Some examples of storage media that may be used include random access memory (RAM), read only memory (ROM), flash memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM and so forth. A software module may comprise a single instruction, or many instructions, and may be distributed over several different code segments, among different programs, and across multiple storage media. A storage medium may be coupled to a processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor.

The methods disclosed herein comprise one or more steps or actions for achieving the described method. The method steps and/or actions may be interchanged with one another without departing from the scope of the claims. In other words, unless a specific order of steps or actions is specified, the order and/or use of specific steps and/or actions may be modified without departing from the scope of the claims.

The functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in hardware, an example hardware configuration may comprise a processing system in a device. The processing system may be implemented with a bus architecture. The bus may include any number of interconnecting buses and bridges depending on the specific application of the processing system and the overall design constraints. The bus may link together various circuits including a processor, machine-readable media, and a bus interface. The bus interface may be used to connect a network adapter, among other things, to the processing system via the bus. The network adapter may be used to implement signal processing functions. For certain aspects, a user interface (e.g., keypad, display, mouse, joystick, etc.) may also be connected to the bus. The bus may also link various other circuits such as timing sources, peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further.

The processor may be responsible for managing the bus and general processing, including the execution of software stored on the machine-readable media. The processor may be implemented with one or more general-purpose and/or special-purpose processors. Examples include microprocessors, microcontrollers, DSP processors, and other circuitry that can execute software. Software shall be construed broadly to mean instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. Machine-readable media may include, by way of example, RAM (Random Access Memory), flash memory, ROM (Read Only Memory), PROM (Programmable Read-Only Memory), EPROM (Erasable Programmable Read-Only Memory), EEPROM (Electrically Erasable Programmable Read-Only Memory), registers, magnetic disks, optical disks, hard drives, or any other suitable storage medium, or any combination thereof. The machine-readable media may be embodied in a computer-program product. The computer-program product may comprise packaging materials.

In a hardware implementation, the machine-readable media may be part of the processing system separate from the processor. However, as those skilled in the art will readily appreciate, the machine-readable media, or any portion thereof, may be external to the processing system. By way of example, the machine-readable media may include a transmission line, a carrier wave modulated by data, and/or a computer product separate from the device, all which may be accessed by the processor through the bus interface. Alternatively, or in addition, the machine-readable media, or any portion thereof, may be integrated into the processor, such as the case may be with cache and/or general register files.

The processing system may be configured as a general-purpose processing system with one or more microprocessors providing the processor functionality and external memory providing at least a portion of the machine-readable media, all linked together with other supporting circuitry through an external bus architecture. Alternatively, the processing system may be implemented with an ASIC (Application Specific Integrated Circuit) with the processor, the bus interface, the user interface, supporting circuitry, and at least a portion of the machine-readable media integrated into a single chip, or with one or more FPGAs (Field Programmable Gate Arrays), PLDs (Programmable Logic Devices), controllers, state machines, gated logic, discrete hardware components, or any other suitable circuitry, or any combination of circuits that can perform the various functionality described throughout this disclosure. Those skilled in the art will recognize how best to implement the described functionality for the processing system depending on the particular application and the overall design constraints imposed on the overall system.

The machine-readable media may comprise a number of software modules. The software modules include instructions that, when executed by the processor, cause the processing system to perform various functions. The software modules may include a transmission module and a receiving module. Each software module may reside in a single storage device or be distributed across multiple storage devices. By way of example, a software module may be loaded into RAM from a hard drive when a triggering event occurs. During execution of the software module, the processor may load some of the instructions into cache to increase access speed. One or more cache lines may then be loaded into a general register file for execution by the processor. When referring to the functionality of a software module below, it will be understood that such functionality is implemented by the processor when executing instructions from that software module.

If implemented in software, the functions may be stored or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media include both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage medium may be any available medium that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared (IR), radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and Blu-ray® disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Thus, in some aspects computer-readable media may comprise non-transitory computer-readable media (e.g., tangible media). In addition, for other aspects computer-readable media may comprise transitory computer-readable media (e.g., a signal). Combinations of the above should also be included within the scope of computer-readable media.

Thus, certain aspects may comprise a computer program product for performing the operations presented herein. For example, such a computer program product may comprise a computer readable medium having instructions stored (and/or encoded) thereon, the instructions being executable by one or more processors to perform the operations described herein. For certain aspects, the computer program product may include packaging material.

Further, it should be appreciated that modules and/or other appropriate means for performing the methods and techniques described herein can be downloaded and/or otherwise obtained by a device as applicable. For example, such a device can be coupled to a server to facilitate the transfer of means for performing the methods described herein. Alternatively, various methods described herein can be provided via storage means (e.g., RAM, ROM, a physical storage medium such as a compact disc (CD) or floppy disk, etc.), such that a device can obtain the various methods upon coupling or providing the storage means to the device. Moreover, any other suitable technique for providing the methods and techniques described herein to a device can be utilized.

It is to be understood that the claims are not limited to the precise configuration and components illustrated above. Various modifications, changes and variations may be made in the arrangement, operation and details of the methods and apparatus described above without departing from the scope of the claims. 

What is claimed is:
 1. A method for operating an artificial neuron, comprising: determining that a first state of the artificial neuron is within a first region; determining a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; determining that the second state of the artificial neuron is within a second region, wherein at least one of the first region or the second region is defined by two or more dimensions; and determining a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.
 2. The method of claim 1, wherein at least one of the first region or the second region is an M-dimensional subspace, where M≧2.
 3. The method of claim 2, wherein the M-dimensional subspace has a shape that is at least one of an ellipse, a circle, a polygon, a rectangle, a square a sphere, an ellipsoid, a polygonal prism, a rectangular prism, or a cube.
 4. The method of claim 1, wherein the first region is associated with a different set of linear equations than the second region.
 5. The method of claim 1, wherein the first and second regions are non-overlapping regions.
 6. The method of claim 1, wherein the two or more dimensions comprise two dimensions defined by a membrane potential (v) and a recovery current (u).
 7. The method of claim 6, further comprising resetting at least one of the membrane potential or the recovery current of the artificial neuron based at least in part on at least one of receipt of a control signal or a determination that a spike event has occurred or will occur.
 8. The method of claim 7, wherein the membrane potential is reset to a resting potential and wherein the recovery current is reset to a constant.
 9. The method of claim 1, wherein the first and second regions have at least one of different shapes or different sizes.
 10. The method of claim 1, wherein the first region is associated with a first behavior of the artificial neuron and wherein the second region is associated with a second behavior of the artificial neuron, different from the first behavior.
 11. The method of claim 1, wherein the artificial neuron is configured for subthreshold oscillation behavior.
 12. The method of claim 11, wherein the subthreshold oscillation behavior comprises at least one of a decaying oscillation behavior, a sustained oscillation behavior, or a growing oscillation behavior.
 13. The method of claim 12, wherein the first region is associated with the growing oscillation behavior, wherein the second region is associated with the sustained oscillation behavior, and wherein a third region is associated with the decaying oscillation behavior.
 14. The method of claim 13, wherein a fourth region is associated with an anti-leaky integrate-and-fire (ALIF) behavior.
 15. The method of claim 13, wherein the first region has an elliptical shape and wherein the second region has a ring shape.
 16. The method of claim 1, wherein at least a portion of the second region overlaps the first region and wherein determining that the second state of the artificial neuron is within the second region is based at least in part on hysteresis.
 17. The method of claim 1, wherein the artificial neuron is configured for onset detection and event counting, wherein the first region is associated with an integrate-and-fire (IF) behavior for the event counting, and wherein the second region is associated with a leaky integrate-and-fire (LIF) behavior.
 18. The method of claim 1, wherein at least one of the first or second set of parameters is obtained by approximating, with a piecewise linear function, at least a portion of a nonlinear function in a neuron model associated with the artificial neuron.
 19. The method of claim 1, wherein the first and second sets of linear equations comprise discrete time solutions of linear time-invariant (LTI) state-space equations.
 20. The method of claim 1, wherein the first and second regions comprise layered shapes.
 21. An apparatus for operating an artificial neuron, comprising: a processing system configured to: determine that a first state of the artificial neuron is within a first region; determine a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; determine that the second state of the artificial neuron is within a second region, wherein at least one of the first region or the second region is defined by two or more dimensions; and determine a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region; and a memory coupled to the processing system.
 22. The apparatus of claim 21, wherein at least one of the first region or the second region is an M-dimensional subspace, where M≧2.
 23. The apparatus of claim 22, wherein the M-dimensional subspace has a shape that is at least one of an ellipse, a circle, a polygon, a rectangle, a square a sphere, an ellipsoid, a polygonal prism, a rectangular prism, or a cube.
 24. The apparatus of claim 21, wherein the first region is associated with a different set of linear equations than the second region.
 25. The apparatus of claim 21, wherein the first and second regions are partially overlapping regions.
 26. The apparatus of claim 21, wherein the two or more dimensions comprise two dimensions defined by a membrane potential (v) and a recovery current (u).
 27. The apparatus of claim 26, wherein the processing system is further configured to reset at least one of the membrane potential or the recovery current of the artificial neuron based at least in part on at least one of receipt of a control signal or a determination that a spike event has occurred or will occur.
 28. The apparatus of claim 27, wherein the membrane potential is reset to a resting potential and wherein the recovery current is reset to a sum of a present value of the recovery current and an offset.
 29. The apparatus of claim 21, wherein the first and second regions have at least one of different shapes or different sizes.
 30. The apparatus of claim 21, wherein the first region is associated with a first behavior of the artificial neuron and wherein the second region is associated with a second behavior of the artificial neuron, different from the first behavior.
 31. The apparatus of claim 21, wherein the artificial neuron is configured for subthreshold oscillation behavior.
 32. The apparatus of claim 31, wherein the subthreshold oscillation behavior comprises at least one of a decaying oscillation behavior, a sustained oscillation behavior, or a growing oscillation behavior.
 33. The apparatus of claim 32, wherein the first region is associated with the growing oscillation behavior, wherein the second region is associated with the sustained oscillation behavior, and wherein a third region is associated with the decaying oscillation behavior.
 34. The apparatus of claim 33, wherein a fourth region is associated with an anti-leaky integrate-and-fire (ALIF) behavior.
 35. The apparatus of claim 33, wherein the first region has an elliptical shape and wherein the second region has a ring shape.
 36. The apparatus of claim 21, wherein at least a portion of the second region overlaps the first region and wherein the processing system is configured to determine that the second state of the artificial neuron is within the second region based at least in part on hysteresis.
 37. The apparatus of claim 21, wherein the artificial neuron is configured for onset detection and event counting, wherein the first region is associated with an integrate-and-fire (IF) behavior for the event counting, and wherein the second region is associated with a leaky integrate-and-fire (LIF) behavior.
 38. The apparatus of claim 21, wherein at least one of the first or second set of parameters is obtained by approximating, with a piecewise linear function, at least a portion of a nonlinear function in a neuron model associated with the artificial neuron.
 39. The apparatus of claim 21, wherein the first and second sets of linear equations comprise discrete time solutions of linear time-invariant (LTI) state-space equations.
 40. The apparatus of claim 21, wherein the first and second regions comprise layered shapes.
 41. An apparatus for operating an artificial neuron, comprising: means for determining that a first state of the artificial neuron is within a first region; means for determining a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; means for determining that the second state of the artificial neuron is within a second region, wherein at least one of the first region or the second region is defined by two or more dimensions; and means for determining a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region.
 42. A computer program product for operating an artificial neuron, comprising a computer-readable medium having instructions executable to: determine that a first state of the artificial neuron is within a first region; determine a second state of the artificial neuron based at least in part on a first set of linear equations, wherein the first set of linear equations is based at least in part on a first set of parameters corresponding to the first region; determine that the second state of the artificial neuron is within a second region, wherein at least one of the first region or the second region is defined by two or more dimensions; and determine a third state of the artificial neuron based at least in part on a second set of linear equations, wherein the second set of linear equations is based at least in part on a second set of parameters corresponding to the second region. 